#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, a, b;
int gcd(int i, int j) {
  if (j == 0) return i;
  return gcd(j, i % j);
}
void solve() {
  int g = gcd(a, b);
  a /= g;
  b /= g;
  int r = min(n / a, m / b);
  int w = a * r;
  int h = b * r;
  int x1 = x - (w + 1) / 2;
  int x2 = x1 + w;
  if (x1 < 0) {
    x2 += -x1;
    x1 = 0;
  } else if (x2 > n) {
    x1 -= x2 - n;
    x2 = n;
  }
  int y1 = y - (h + 1) / 2;
  int y2 = y1 + h;
  if (y1 < 0) {
    y2 += -y1;
    y1 = 0;
  } else if (y2 > m) {
    y1 -= y2 - m;
    y2 = m;
  }
  cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
}
int main() {
  cin >> n >> m >> x >> y >> a >> b;
  solve();
  return 0;
}
