#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, a, b;
inline int gcd(int a, int b) { return (!b) ? a : gcd(b, a % b); }
int main() {
  scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b);
  int g = gcd(a, b);
  a /= g, b /= g;
  int h = min(n / a, m / b);
  int A = a * h, B = b * h;
  int X = x - (A + 1) / 2, Y = y - (B + 1) / 2;
  if (X < 0) X = 0;
  if (Y < 0) Y = 0;
  if (X > n - A) X = n - A;
  if (Y > m - B) Y = m - B;
  printf("%d %d %d %d\n", X, Y, X + A, Y + B);
}
