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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.InputMismatchException;


public class TaskB implements Runnable {

	private int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a%b);
	}
	
	private void begin() {
		in = new InputReader(System.in);
		out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
	}
	
	private void end() {
		out.flush();
	}
	
	private InputReader in;
	private PrintWriter out;
	
	private int x;
	private int y;
	
	private int maxX;
	private int maxY;
	
	@Override
	public void run() {
		begin();
		maxX = in.readInt();
		maxY = in.readInt();
		x = in.readInt();
		y = in.readInt();
		int a = in.readInt();
		int b = in.readInt();
		int g = gcd(a, b);
		long m = b/g;
		long var1H = m*(maxY/m);
		long var1W = a*var1H/b;
		if (var1W <= maxX) {
			solve((int)var1H, (int)var1W);
		}
		else {
			long m2 = a/g;
			long var2W = m2*(maxX/m2);
			long var2H = var2W*b/a;
			solve((int)var2H, (int)var2W);
		}
		end();
	}

	private void solve(int h, int w) {
		int x1 = x - (w+1)/2;
		int y1 = y - (h+1)/2;
		int x2 = x + w/2;
		int y2 = y + h/2;
		if (x1 < 0) {
			x2 -= x1;
			x1 = 0;
		}
		if (y1 < 0) {
			y2 -= y1;
			y1 = 0;
		}
		if (x2 > maxX) {
			x1 -= x2 - maxX;
			x2 = maxX;
		}
		if (y2 > maxY) {
			y1 -= y2 - maxY;
			y2 = maxY;
		}
		out.println(x1 + " " + y1 + " " + x2 + " " + y2);
	}

	private class InputReader {

		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int read() {
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} 
				catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		
		public int readInt() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sign = 1;
			if (c == '-') {
				sign = -1;
				c = read();
			}
			int res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} 
			while (!isSpaceChar(c));
			return res*sign;
		}
		
		public long readLong() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sign = 1;
			if (c == '-') {
				sign = -1;
				c = read();
			}
			long res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} 
			while (!isSpaceChar(c));
			return res*sign;
		}
		
		public boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
	}

	public static void main(String[] args) {
		new TaskB().run();
	}
	
}
