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.*;
import java.util.Locale;
import java.util.StringTokenizer;

public class A implements Runnable {

    private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

    private BufferedReader in;
    private PrintWriter out;
    private StringTokenizer tok = new StringTokenizer("");

    private void init() throws FileNotFoundException {
        Locale.setDefault(Locale.US);
        String fileName = "";
        if (ONLINE_JUDGE && fileName.isEmpty()) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            if (fileName.isEmpty()) {
                in = new BufferedReader(new FileReader("input.txt"));
                out = new PrintWriter("output.txt");
            } else {
                in = new BufferedReader(new FileReader(fileName + ".in"));
                out = new PrintWriter(fileName + ".out");
            }
        }
    }

    String readString() {
        while (!tok.hasMoreTokens()) {
            try {
                tok = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                return null;
            }
        }
        return tok.nextToken();
    }

    int readInt() {
        return Integer.parseInt(readString());
    }

    long readLong() {
        return Long.parseLong(readString());
    }

    double readDouble() {
        return Double.parseDouble(readString());
    }

    int[] readIntArray(int size) {
        int[] a = new int[size];
        for (int i = 0; i < size; i++) {
            a[i] = readInt();
        }
        return a;
    }

    public static void main(String[] args) {
        //new Thread(null, new _Solution(), "", 128 * (1L << 20)).start();
        new A().run();
    }

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    @Override
    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            init();
            solve();
            out.close();
            time();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    int gcd(int a, int b) {
        return a == 0 ? b : gcd(b % a, a);
    }

    private void solve() {
        int n = readInt();
        int m = readInt();
        int x = readInt();
        int y = readInt();
        int a = readInt();
        int b = readInt();

        int gcd = gcd(a, b);
        a /= gcd;
        b /= gcd;

        int width = 0;
        int height = 0;
        int left = 0, right = n / a;
        while (left <= right) {
            int mid = (left + right) >> 1;
            long curWidth = 1l * a * mid;
            if (curWidth <= n) {
                long curHeight = 1l * mid * b;
                if (curHeight <= m) {
                    width = (int) curWidth;
                    height = (int) curHeight;
                    left = mid + 1;
                } else {
                    right = mid - 1;
                }
            } else {
                right = mid - 1;
            }
        }

        int x1 = x - width / 2 - width % 2;
        if (x1 < 0) {
            x1 = 0;
        }
        if (x1 + width > n) {
            x1 = n - width;
        }

        int y1 = y - height / 2 - height % 2;
        if (y1 < 0) {
            y1 = 0;
        }
        if (y1 + height > m) {
            y1 = m - height;
        }

        int xAns = x1;
        int yAns = y1;
        String answer = xAns + " " + yAns + " " + (xAns + width) + " " + (yAns + height);

        final int delta = 10;
        for (int xx = x1 - delta; xx <= x1 + delta; xx++) {
            for (int yy = y1 - delta; yy <= y1 + delta; yy++) {
                if (xx >= 0 && xx + width <= n && yy >= 0 && yy + height <= m &&
                        xx <= x && x <= xx + width && yy <= y && y <= yy + height) {
                    long distAns = getDistSqr(2 * x, 2 * y, 2 * xAns + width, 2 * yAns + height);
                    long distCur = getDistSqr(2 * x, 2 * y, 2 * xx + width, 2 * yy + height);
                    if (distCur < distAns) {
                        xAns = xx;
                        yAns = yy;
                        answer = xAns + " " + yAns + " " + (xAns + width) + " " + (yAns + height);
                    } else if (distCur == distAns) {
                        String curAnswer = xx + " " + yy + " " + (xx + width) + " " + (yy + height);
                        if (curAnswer.compareTo(answer) < 0) {
                            xAns = xx;
                            yAns = yy;
                            answer = xAns + " " + yAns + " " + (xAns + width) + " " + (yAns + height);
                        }
                    }
                }
            }
        }

        out.println(answer);
    }

    long getDistSqr(int x1, int y1, int x2, int y2) {
        if (x2 < 0 || y2 < 0) {
            System.err.println("hell");
        }
        long dx = x1 - x2;
        long dy = y1 - y2;
        return dx * dx + dy * dy;
    }
}