#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
int main() {
  int n, m;
  while (cin >> n >> m) {
    int x, y, a, b;
    scanf("%d %d", &x, &y);
    ;
    scanf("%d %d", &a, &b);
    ;
    int g = gcd(a, b);
    a /= g;
    b /= g;
    int tmp = min(n / a, m / b);
    a *= tmp;
    b *= tmp;
    int rx = min(max(0, x - int(ceil(a / 2.0))), n - a),
        ry = min(max(0, y - int(ceil(b / 2.0))), m - b);
    cout << rx << ' ' << ry << ' ' << rx + a << ' ' << ry + b << endl;
  }
  return 0;
}
