#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) { return (!y ? x : gcd(y, x % y)); }
int main() {
  int n, m, x, y, a, b;
  scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b);
  int d = gcd(a, b);
  a /= d;
  b /= d;
  int k = min(n / a, m / b);
  a *= k;
  b *= k;
  int x2 = x + a / 2;
  int y2 = y + b / 2;
  int x1 = x2 - a;
  int y1 = y2 - b;
  if (x2 > n) {
    x2 = n;
    x1 = n - a;
  }
  if (x1 < 0) {
    x1 = 0;
    x2 = a;
  }
  if (y2 > m) {
    y2 = m;
    y1 = m - b;
  }
  if (y1 < 0) {
    y1 = 0;
    y2 = b;
  }
  printf("%d %d %d %d\n", x1, y1, x2, y2);
  return 0;
}
