No tag edit access

B. Rectangle Puzzle II

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a rectangle grid. That grid's size is *n* × *m*. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (*x*, *y*) (0 ≤ *x* ≤ *n*, 0 ≤ *y* ≤ *m*).

Your task is to find a maximum sub-rectangle on the grid (*x*_{1}, *y*_{1}, *x*_{2}, *y*_{2}) so that it contains the given point (*x*, *y*), and its length-width ratio is exactly (*a*, *b*). In other words the following conditions must hold: 0 ≤ *x*_{1} ≤ *x* ≤ *x*_{2} ≤ *n*, 0 ≤ *y*_{1} ≤ *y* ≤ *y*_{2} ≤ *m*, .

The sides of this sub-rectangle should be parallel to the axes. And values *x*_{1}, *y*_{1}, *x*_{2}, *y*_{2} should be integers.

If there are multiple solutions, find the rectangle which is closest to (*x*, *y*). Here "closest" means the Euclid distance between (*x*, *y*) and the center of the rectangle is as small as possible. If there are still multiple solutions, find the lexicographically minimum one. Here "lexicographically minimum" means that we should consider the sub-rectangle as sequence of integers (*x*_{1}, *y*_{1}, *x*_{2}, *y*_{2}), so we can choose the lexicographically minimum one.

Input

The first line contains six integers *n*, *m*, *x*, *y*, *a*, *b* (1 ≤ *n*, *m* ≤ 10^{9}, 0 ≤ *x* ≤ *n*, 0 ≤ *y* ≤ *m*, 1 ≤ *a* ≤ *n*, 1 ≤ *b* ≤ *m*).

Output

Print four integers *x*_{1}, *y*_{1}, *x*_{2}, *y*_{2}, which represent the founded sub-rectangle whose left-bottom point is (*x*_{1}, *y*_{1}) and right-up point is (*x*_{2}, *y*_{2}).

Examples

Input

9 9 5 5 2 1

Output

1 3 9 7

Input

100 100 52 50 46 56

Output

17 8 86 92

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/28/2017 04:47:52 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|