#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
  while (y != 0) {
    int t = y;
    y = x % y;
    x = t;
  }
  return x;
}
int main() {
  int n, m, x, y, a, b, x1, y1;
  cin >> n >> m >> x >> y >> a >> b;
  int r = gcd(a, b);
  a /= r;
  b /= r;
  int k = min(n / a, m / b);
  int dx = k * a, dy = k * b;
  x1 = x - (dx / 2 + dx % 2);
  if (x1 < 0) x1 = 0;
  if (x1 > n - dx) x1 = n - dx;
  y1 = y - (dy / 2 + dy % 2);
  if (y1 < 0) y1 = 0;
  if (y1 > m - dy) y1 = m - dy;
  cout << x1 << " " << y1 << " " << x1 + dx << " " << y1 + dy << endl;
  return 0;
}
