#include <bits/stdc++.h>
using namespace std;
int A[500];
inline int gcd(int a, int b) {
  int c = a % b;
  while (c != 0) {
    a = b;
    b = c;
    c = a % b;
  }
  return b;
}
int main() {
  int n, m, x, y, a, b;
  int x1, y1, x2, y2;
  cin >> n >> m >> x >> y >> a >> b;
  int k = gcd(a, b);
  a /= k;
  b /= k;
  ;
  ;
  int rx = min(n - x, x);
  int ry = min(m - y, y);
  int aa = min(n / a, m / b);
  int maxn = aa * a;
  int maxm = aa * b;
  x1 = 0, y1 = 0, x2 = maxn, y2 = maxm;
  ;
  ;
  if (x > (x1 + x2 + 1) / 2) {
    int zz = min(x - (x1 + x2 + 1) / 2, n - x2);
    ;
    ;
    x1 += zz;
    x2 += zz;
  }
  if (y > (y1 + y2 + 1) / 2) {
    int zz = min(y - (y1 + y2 + 1) / 2, m - y2);
    y1 += zz;
    y2 += zz;
  }
  cout << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
  return 0;
}
