ADA Training CP

Anniversary Cake

Time limit 1 second
Memory limit 128 MiB

Two students, Adam and Anton, are celebrating two-year anniversary of not passing their Math Logic exam. After very careful search in a local supermarket, they bought a rectangular cake with integer dimensions and two candles.

Later in the campus Adam put the candles into different integer points of the cake and gave a knife to Anton to cut the cake. The cut should start and end at integer points at the edges of the cake, and it should not touch the candles. Also each piece should have exactly one candle at it. Please, help Anton to find the starting and ending points of the cut.

Input data

The single line contains six integers: w, h - cake dimensions; a[x], a[y] - x and y coordinates of the first candle; b[x], b[y] - the coordinates of the second candle (3w, h10^9, 0 < a[x], b[x] < w; 0 < a[y], b[y] < h; a[x]b[x] or a[y]b[y]).

Output data

Output four integers s[x], s[y], e[x] and e[y] - the starting and ending coordinates of the cut. Both starting and ending point of the cut should belong to the sides of the cake.

If there are several solutions, output any of them.


Input example #1
7 3 2 2 3 2
Output example #1
2 0 3 3
Source 2016 ACM NEERC, Northern region, October 22, Problem A