#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  while (b) {
    long long tmp = a % b;
    a = b;
    b = tmp;
  }
  return a;
}
int main() {
  long long n, m, x, y, a, b;
  cin >> n >> m >> x >> y >> a >> b;
  long long k = gcd(a, b);
  a /= k;
  b /= k;
  k = min(n / a, m / b);
  a *= k;
  b *= k;
  long long x1, y1, x2, y2;
  x1 = max(x - (a + 1) / 2, (long long)0);
  x1 = x1 + a > n ? n - a : x1;
  x2 = x1 + a;
  y1 = max(y - (b + 1) / 2, (long long)0);
  y1 = y1 + b > m ? m - b : y1;
  y2 = y1 + b;
  cout << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
  return 0;
}
