#include <bits/stdc++.h>
using namespace std;
const double PI = 3.1415926535;
int n, m, x, y, a, b;
int gcd(int a, int b) {
  while (a) a ^= b ^= a ^= b %= a;
  return b;
}
int binsearch(long long l = 1, long long r = 1000000000) {
  if (r - l < 2) {
    if (r * a > n || r * b > m) return l;
    return r;
  }
  long long mid = (r + l) / 2;
  if (mid * a > n || mid * b > m)
    return binsearch(l, mid - 1);
  else
    return binsearch(mid, r);
}
int main() {
  cin >> n >> m >> x >> y >> a >> b;
  int g = gcd(a, b);
  a /= g;
  b /= g;
  long long t = binsearch();
  int x1 = x - (t * a) / 2 - (t * a) % 2, x2 = x + (t * a) / 2,
      ololo = y - (t * b) / 2 - (t * b) % 2, y2 = y + (t * b) / 2;
  if (x1 < 0) x2 -= x1, x1 = 0;
  if (ololo < 0) y2 -= ololo, ololo = 0;
  if (x2 > n) x1 -= (x2 - n), x2 -= (x2 - n);
  if (y2 > m) ololo -= (y2 - m), y2 -= (y2 - m);
  cout << x1 << ' ' << ololo << ' ' << x2 << ' ' << y2;
  return 0;
}
