#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, a, b;
int gcd(int c, int d) {
  if (c < d) swap(c, d);
  if (c % d == 0) return d;
  return gcd(d, c % d);
}
int main() {
  scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b);
  int ti = gcd(a, b);
  a /= ti;
  b /= ti;
  int rat = min((n) / a, (m) / b);
  a *= rat;
  b *= rat;
  int x0, y0;
  x0 = x - (a + 1) / 2;
  if (x0 < 0) x0 = 0;
  if (x0 + a > n) x0 = n - a;
  y0 = y - (b + 1) / 2;
  if (y0 < 0) y0 = 0;
  if (y0 + b > m) y0 = m - b;
  printf("%d %d %d %d\n", x0, y0, x0 + a, y0 + b);
  return 0;
}
