#include <bits/stdc++.h>
using namespace std;
long long int n, m, x, y, a, b, lx, ly, sx, sy, k;
long long int gcd(long long int A, long long int B) {
  return B == 0 ? A : gcd(B, A % B);
}
int main() {
  scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &n, &m, &x, &y, &a, &b);
  k = gcd(a, b);
  a /= k;
  b /= k;
  if (n * b < a * m) {
    lx = (n / a) * a;
    ly = (lx / a) * b;
  } else {
    ly = (m / b) * b;
    lx = (ly / b) * a;
  }
  if (x * 2 > lx) sx = min(n - lx, x - (lx + 1) / 2);
  if (y * 2 > ly) sy = min(m - ly, y - (ly + 1) / 2);
  printf("%I64d %I64d %I64d %I64d\n", sx, sy, sx + lx, sy + ly);
  return 0;
}
