#include <bits/stdc++.h>
using namespace std;
long long N, M, X, Y, A, B;
long long solve(long long sz, long long tot, long long x) {
  if (2 * x >= sz && 2 * (tot - x) >= sz) return x - (sz + 1) / 2;
  if (2 * x < sz) return 0;
  return tot - sz;
}
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  cin >> N >> M >> X >> Y >> A >> B;
  bool check = false;
  if (N * B > M * A) {
    swap(N, M);
    swap(X, Y);
    swap(A, B);
    check = true;
  }
  long long g = gcd(A, B);
  A /= g;
  B /= g;
  long long len = (N - (N % A));
  long long wid = len * B / A;
  long long x1 = solve(len, N, X);
  long long y1 = solve(wid, M, Y);
  long long x2 = x1 + len;
  long long y2 = y1 + wid;
  if (check) {
    swap(x1, y1);
    swap(x2, y2);
  }
  cout << x1 << " " << y1 << " " << x2 << " " << y2 << "\n";
  return 0;
}
