#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  long long n, m, x, y, a, b;
  scanf("%lld%lld%lld%lld%lld%lld", &n, &m, &x, &y, &a, &b);
  long long g = gcd(a, b);
  a /= g, b /= g;
  long long t = min(n / a, m / b);
  a = a * t, b = b * t;
  long long down = x - (a + 1) / 2;
  if (down < 0)
    down = 0;
  else if (down + a > n)
    down -= down + a - n;
  long long up = y - (b + 1) / 2;
  if (up < 0)
    up = 0;
  else if (up + b > m)
    up -= up + b - m;
  printf("%lld %lld %lld %lld\n", down, up, down + a, up + b);
  return 0;
}
