You 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 (x1, y1, x2, y2) 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 ≤ x1 ≤ x ≤ x2 ≤ n, 0 ≤ y1 ≤ y ≤ y2 ≤ m, <image>.

The sides of this sub-rectangle should be parallel to the axes. And values x1, y1, x2, y2 should be integers.

<image>

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 (x1, y1, x2, y2), so we can choose the lexicographically minimum one.

Input

The first line contains six integers n, m, x, y, a, b (1 ≤ n, m ≤ 109, 0 ≤ x ≤ n, 0 ≤ y ≤ m, 1 ≤ a ≤ n, 1 ≤ b ≤ m).

Output

Print four integers x1, y1, x2, y2, which represent the founded sub-rectangle whose left-bottom point is (x1, y1) and right-up point is (x2, y2).

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
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        long maxx = in.nextInt();
        long maxy = in.nextInt();
        long x = in.nextInt();
        long y = in.nextInt();
        long a = in.nextInt();
        long b = in.nextInt();
        long g = BigInteger.valueOf(a).gcd(BigInteger.valueOf(b)).intValue();
        a /= g;
        b /= g;
        long bdist = Long.MAX_VALUE;
        long x1 = -1;
        long y1 = -1;
        long x2 = -1;
        long y2 = -1;
        long mult = Math.min(maxx / a, maxy / b);
        {
            long sx = a * mult;
            long sy = b * mult;
            long xl = Math.max(0, Math.min(maxx - sx, x - sx / 2));
            for (long dx = 0; dx < 2 && xl >= 0; ++dx, --xl) {
                long yl = Math.max(0, Math.min(maxy - sy, y - sy / 2));
                for (long dy = 0; dy < 2 && yl >= 0; ++dy, --yl) {
                    long xr = xl + sx;
                    long yr = yl + sy;
                    long distx = (xl + xr - 2 * x);
                    long disty = (yl + yr - 2 * y);
                    long dist = distx * distx + disty * disty;
                    boolean ok;
                    if (dist < bdist) {
                        ok = true;
                    } else if (dist > bdist) {
                        ok = false;
                    } else if (xl < x1) {
                        ok = true;
                    } else if (xl > x1) {
                        ok = false;
                    } else if (yl < y1) {
                        ok = true;
                    } else if (yl > y1) {
                        ok = false;
                    } else if (xr < x2) {
                        ok = true;
                    } else if (xr > x2) {
                        ok = false;
                    } else if (yr < y2) {
                        ok = true;
                    } else {
                        ok = false;
                    }
                    if (ok) {
                        bdist = dist;
                        x1 = xl;
                        y1 = yl;
                        x2 = xr;
                        y2 = yr;
                    }
                }
            }
        }
        out.println(x1 + " " + y1 + " " + x2 + " " + y2);
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    }

