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