#include <bits/stdc++.h>
using namespace std;
const int MX = 100005, INF = 1000000000, mod = 1000000009;
const long long int LINF = 1000000000000000000ll;
const double eps = 1e-9;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  int n, m, x, y, a, b, c, x1, y1;
  scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b);
  c = gcd(a, b);
  a /= c;
  b /= c;
  c = 1;
  c = min(n / a, m / b);
  a *= c;
  b *= c;
  x1 = min(max(0, x - (a + 1) / 2), n - a);
  y1 = min(max(0, y - (b + 1) / 2), m - b);
  printf("%d %d %d %d\n", x1, y1, x1 + a, y1 + b);
  return 0;
}
