#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
const double EPS = 1e-9;
const double PI = 3.14159265358979;
int n, m, x, y, a, b;
int gcd(int x, int y) { return (y == 0) ? x : gcd(y, x % y); }
void solve() {
  int g = gcd(a, b);
  a /= g, b /= g;
  int l1 = n / a;
  int l;
  if ((long long)l1 * b <= m) {
    l = l1;
  } else {
    l = m / b;
  }
  int w = l * a;
  int h = l * b;
  int dx = x - (w + 1) / 2;
  int dy = y - (h + 1) / 2;
  if (dx < 0) dx = 0;
  if (dy < 0) dy = 0;
  if (dx + w >= n) dx = n - w;
  if (dy + h >= m) dy = m - h;
  cout << dx << ' ' << dy << ' ' << dx + w << ' ' << dy + h << endl;
}
int main() {
  cin >> n >> m >> x >> y >> a >> b;
  solve();
  return 0;
}
