#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
int main() {
  int n, m, x, y, a, b;
  while (cin >> n >> m >> x >> y >> a >> b) {
    int g = gcd(a, b);
    a /= g;
    b /= g;
    g = min(n / a, m / b);
    a *= g;
    b *= g;
    int lx = max(0, x - (a + 1) / 2);
    int ly = max(0, y - (b + 1) / 2);
    int rx = lx + a;
    int ry = ly + b;
    if (rx > n) {
      lx -= rx - n;
      rx = n;
    }
    if (ry > m) {
      ly -= ry - m;
      ry = m;
    }
    if (lx > rx) swap(lx, rx);
    if (ly > ry) swap(ly, ry);
    cout << lx << " " << ly << " " << rx << " " << ry << endl;
  }
  return 0;
}
