#include <bits/stdc++.h>
using namespace std;
int n, m;
int a, b;
int x, y;
int gcd(int a, int b) { return (!b ? a : gcd(b, a % b)); }
bool check(int mid) {
  long long A = a * (long long)mid;
  long long B = b * (long long)mid;
  if (A > n) return false;
  if (B > m) return false;
  return true;
}
void solve(int k) {
  int A = a * k;
  int B = b * k;
  int cx = (A + 1) / 2;
  int cy = (B + 1) / 2;
  int sx = x - cx;
  int sy = y - cy;
  if (sx < 0) sx = 0;
  if (sy < 0) sy = 0;
  if (sx + A > n) sx = n - A;
  if (sy + B > m) sy = m - B;
  printf("%d %d %d %d\n", sx, sy, sx + A, sy + B);
}
int main(void) {
  scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &a, &b);
  int g = gcd(a, b);
  a /= g;
  b /= g;
  int lo = 1, hi = 1000000000;
  while (lo < hi) {
    int mid = (lo + hi + 1) >> 1;
    if (check(mid))
      lo = mid;
    else
      hi = mid - 1;
  }
  solve(lo);
  return 0;
}
