#include <bits/stdc++.h>
using namespace std;
long long n, m, x, y, a, b;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  while (a % b != 0) {
    long long tmp = a % b;
    a = b;
    b = tmp;
  }
  return b;
}
int main() {
  while (scanf("%lld%lld%lld%lld%lld%lld", &n, &m, &x, &y, &a, &b) != EOF) {
    long long g = gcd(a, b);
    a /= g;
    b /= g;
    long long l = a * min(n / a, m / b);
    long long w = b * min(n / a, m / b);
    long long lx, ly;
    long long hl = (l + 1) / 2, hw = (w + 1) / 2;
    if (x >= hl) {
      if (x + l / 2 <= n)
        lx = x - hl;
      else
        lx = n - l;
    } else
      lx = 0;
    if (y >= hw) {
      if (y + w / 2 <= m)
        ly = y - hw;
      else
        ly = m - w;
    } else
      ly = 0;
    printf("%lld %lld %lld %lld\n", lx, ly, lx + l, ly + w);
  }
  return 0;
}
