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