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