#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (!b) return a;
  return gcd(b, a % b);
}
inline long long solve(long long x, long long a, long long n) {
  if (x - a / 2 >= 0 && x + a / 2 <= n) {
    return x;
  } else if (x - a / 2 < 0) {
    return a / 2;
  } else {
    return n - a / 2;
  }
}
int main() {
  int n, m, x, y, a, b;
  cin >> n >> m >> x >> y >> a >> b;
  int g = gcd(a, b);
  a /= g;
  b /= g;
  int k = min(n / a, m / b);
  a = k * a;
  b = k * b;
  a *= 2;
  b *= 2;
  n *= 2;
  m *= 2;
  x *= 2;
  y *= 2;
  int cx = 0, cy = 0;
  cx = solve(x, a, n);
  cy = solve(y, b, m);
  cx -= a / 2;
  cy -= b / 2;
  cx /= 2;
  cy /= 2;
  printf("%d %d %d %d\n", cx, cy, cx + a / 2, cy + b / 2);
  return 0;
}
