#include <bits/stdc++.h>
using namespace std;
template <typename X>
inline X abs(const X& a) {
  return (a < 0 ? -a : a);
}
template <typename X>
inline X sqr(const X& a) {
  return (a * a);
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void solveB() {
  int n, m, x, y, a, b;
  scanf("%d %d %d %d %d %d", &n, &m, &x, &y, &a, &b);
  int g = gcd(a, b);
  a /= g;
  b /= g;
  double na, nb;
  if (n / a < m / b) {
    na = n - n % a;
    nb = (n / a) * b;
  } else {
    nb = m - m % b;
    na = (m / b) * a;
  }
  double scx = na / 2 - 0.01, scy = nb / 2 - 0.01,
         ecx = (n + 0.0) - na / 2 + 0.01, ecy = (0.0 + m) - nb / 2 + 0.01;
  double fx = x, fy = y;
  double bcx, bcy;
  if (fx > ecx)
    bcx = ecx;
  else if (fx < scx)
    bcx = scx;
  else {
    bcx = fx;
    if ((int)(na + 0.02) % 2 == 1) bcx -= 0.5f;
  }
  if (fy > ecy)
    bcy = ecy;
  else if (fy < scy)
    bcy = scy;
  else {
    bcy = fy;
    if ((int)(nb + 0.02) % 2 == 1) bcy -= 0.5f;
  }
  cout << (int)(bcx - na / 2 + 0.1) << ' ' << (int)(bcy - nb / 2 + 0.1) << ' '
       << (int)(bcx + na / 2 + 0.1) << ' ' << (int)(bcy + nb / 2 + 0.1) << ' '
       << endl;
}
int main() { solveB(); }
