Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Vasily the Bear and Triangle

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasily the bear has a favorite rectangle, it has one vertex at point (0, 0), and the opposite vertex at point (*x*, *y*). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes.

Vasya also loves triangles, if the triangles have one vertex at point *B* = (0, 0). That's why today he asks you to find two points *A* = (*x*_{1}, *y*_{1}) and *C* = (*x*_{2}, *y*_{2}), such that the following conditions hold:

- the coordinates of points:
*x*_{1},*x*_{2},*y*_{1},*y*_{2}are integers. Besides, the following inequation holds:*x*_{1}<*x*_{2}; - the triangle formed by point
*A*,*B*and*C*is rectangular and isosceles ( is right); - all points of the favorite rectangle are located inside or on the border of triangle
*ABC*; - the area of triangle
*ABC*is as small as possible.

Help the bear, find the required points. It is not so hard to proof that these points are unique.

Input

The first line contains two integers *x*, *y* ( - 10^{9} ≤ *x*, *y* ≤ 10^{9}, *x* ≠ 0, *y* ≠ 0).

Output

Print in the single line four integers *x*_{1}, *y*_{1}, *x*_{2}, *y*_{2} — the coordinates of the required points.

Examples

Input

10 5

Output

0 15 15 0

Input

-10 5

Output

-15 0 0 15

Note

Figure to the first sample

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/25/2017 02:29:44 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|