#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& s, pair<T1, T2> P) {
  return s << '<' << P.first << ", " << P.second << '>';
}
template <class T>
ostream& operator<<(ostream& s, vector<T> P) {
  s << "{ ";
  for (int i = 0; i < P.size(); ++i) {
    if (i > 0) s << ", ";
    s << P[i];
  }
  return s << " }" << endl;
}
template <class T1, class T2>
ostream& operator<<(ostream& s, map<T1, T2> P) {
  s << "{ ";
  for (typeof(P.begin()) it = P.begin(); it != P.end(); ++it) {
    if (it != P.begin()) s << ", ";
    s << '<' << it->first << "->" << it->second << '>';
  }
  return s << " }" << endl;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int main() {
  long long n, m, x, y, a, b;
  while (cin >> n >> m >> x >> y >> a >> b) {
    long long d = gcd(a, b);
    a /= d;
    b /= d;
    long long sx = n / a, sy = m / b;
    long long s = min(sx, sy);
    long long dx = s * a, dy = s * b;
    long long dx1 = (dx + 1) / 2, dx2 = dx / 2, dy1 = (dy + 1) / 2,
              dy2 = dy / 2;
    long long ax = x + dx2, ay = y + dy2;
    if (ax > n) {
      dx2 = n - x;
      dx1 = dx - dx2;
    }
    if (x < dx1) {
      dx1 = x;
      dx2 = dx - dx1;
    }
    if (ay > m) {
      dy2 = m - y;
      dy1 = dy - dy2;
    }
    if (y < dy1) {
      dy1 = y;
      dy2 = dy - dy1;
    }
    cout << x - dx1 << " " << y - dy1 << " " << x + dx2 << " " << y + dy2
         << endl;
  }
  return 0;
}
