#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  int n, m, x, y, a, b, lenx, leny;
  int ansx1, ansy1, ansx2, ansy2;
  while (scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b) != EOF) {
    int tem = gcd(a, b);
    a = a / tem;
    b = b / tem;
    for (int i = 1;; i++) {
      if (a * i <= n && b * i <= m) {
        lenx = a * i;
        leny = b * i;
      } else
        break;
    }
    if (lenx % 2 == 0)
      ansx1 = max(0, x - lenx / 2);
    else
      ansx1 = max(0, x - (lenx / 2 + 1));
    ansx2 = ansx1 + lenx;
    if (ansx2 > n) {
      ansx2 = n;
      ansx1 = n - lenx;
    }
    if (leny % 2 == 0)
      ansy1 = max(0, y - leny / 2);
    else
      ansy1 = max(0, y - (leny / 2 + 1));
    ansy2 = ansy1 + leny;
    if (ansy2 > m) {
      ansy2 = m;
      ansy1 = m - leny;
    }
    printf("%d %d %d %d\n", ansx1, ansy1, ansx2, ansy2);
  }
  return 0;
}
