#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
int main(void) {
  int n, m, a, b, x, y, t, x1, x2, y1, y2;
  cin >> n >> m >> x >> y >> a >> b;
  t = gcd(a, b);
  a /= t;
  b /= t;
  t = min(n / a, m / b);
  a *= t;
  b *= t;
  x1 = x - (a + 1) / 2;
  x2 = x1 + a;
  y1 = y - (b + 1) / 2;
  y2 = y1 + b;
  if (x1 < 0) x2 -= x1, x1 = 0;
  if (y1 < 0) y2 -= y1, y1 = 0;
  if (x2 > n) x1 -= (x2 - n), x2 = n;
  if (y2 > m) y1 -= (y2 - m), y2 = m;
  cout << x1 << " " << y1 << " " << x2 << " " << y2;
  return 0;
}
