#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int n, i, j, m, x, y, a, b;
  while (~scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b)) {
    int d = gcd(a, b);
    a /= d;
    b /= d;
    int t = min(n / a, m / b);
    a *= t;
    b *= t;
    int x1 = x - (a + 1) / 2, y1 = y - (b + 1) / 2;
    if (x1 < 0) x1 = 0;
    if (y1 < 0) y1 = 0;
    if (x1 + a > n) x1 = n - a;
    if (y1 + b > m) y1 = m - b;
    printf("%d %d %d %d\n", x1, y1, x1 + a, y1 + b);
  }
  return 0;
}
