#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a > b) return gcd(b, a);
  if (a == 0) return b;
  return gcd(b % a, 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 k = min(n / a, m / b);
  a *= k;
  b *= k;
  long long nx = max(0ll, x - ((a + 1) / 2));
  long long ny = max(0ll, y - ((b + 1) / 2));
  if (nx + a > n) nx -= (nx + a - n);
  if (ny + b > m) ny -= (ny + b - m);
  cout << nx << " " << ny << " " << nx + a << " " << ny + b << endl;
  return 0;
}
