#include <bits/stdc++.h>
using namespace std;
int ans = 0, n, x, y;
int gcd(int x, int y) {
  int t;
  while (t = x % y) {
    x = y;
    y = t;
  }
  return y;
}
int main() {
  int i, j, k, m, a, b, x0, y0, x1, y1;
  cin >> n >> m >> x >> y >> a >> b;
  k = gcd(a, b);
  a /= k;
  b /= k;
  k = min(n / a, m / b);
  a *= k;
  b *= k;
  y0 = min(m - b, y - (b - b / 2));
  y0 = max(0, y0);
  x0 = min(n - a, x - (a - a / 2));
  x0 = max(0, x0);
  x1 = x0 + a;
  y1 = y0 + b;
  printf("%d %d %d %d\n", x0, y0, x1, y1);
  return 0;
}
