#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T t) {
  return t < 0 ? -t : t;
}
const long long modn = 1000000007;
inline long long mod(long long x) { return x % modn; }
const int MAXN = 212345;
long long n, m, k, x, y;
int s[MAXN];
long long gcd(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
bool join(long long &a, long long &n, long long b, long long m) {
  long long x, y;
  long long gc = gcd(n, m, x, y);
  if ((a - b) % gc != 0 || (n == m && a != b)) return false;
  long long lcm = (n / gc) * m;
  long long res = (a + x * (b - a) / gc % (m / gc) * n) % lcm;
  res = (res + lcm) % lcm;
  a = res;
  n = lcm;
  return true;
}
void normalize(vector<long long> &val, vector<long long> &md) {
  for (int i = 0; i < val.size(); i++)
    val[i] = (val[i] % md[i] + md[i]) % md[i];
}
long long crt(vector<long long> &val, vector<long long> &md) {
  normalize(val, md);
  long long lval = val[0], lmd = md[0];
  for (int i = 1; i < val.size(); i++) {
    if (!join(lval, lmd, val[i], md[i])) return -1;
  }
  return lval;
}
int main() {
  int vx, vy;
  scanf("%lld%lld%lld%lld%d%d", &n, &m, &x, &y, &vx, &vy);
  if (vx == 0) {
    if (x == 0)
      printf("0 %lld\n", (vy == 1 ? m : 0));
    else if (x == n)
      printf("%lld %lld\n", n, (vy == 1 ? m : 0));
    else
      puts("-1");
    return 0;
  }
  if (vy == 0) {
    if (y == 0)
      printf("%lld 0", (vx == 1 ? n : 0));
    else if (y == m)
      printf("%lld %lld", (vx == 1 ? n : 0), m);
    else
      puts("-1");
    return 0;
  }
  vector<long long> val, md;
  val.push_back((vx == 1 ? n - x : x));
  md.push_back(n);
  val.push_back((vy == 1 ? m - y : y));
  md.push_back(m);
  long long res = crt(val, md);
  if (res == -1) {
    puts("-1");
  } else {
    bool left, bott;
    if (vx > 0)
      left = (((res + x) / n) % 2 == 0);
    else
      left = (((res + n - x) / n) % 2 == 1);
    if (vy > 0)
      bott = (((res + y) / m) % 2 == 0);
    else
      bott = (((res + m - y) / m) % 2 == 1);
    if (left)
      printf("0 ");
    else
      printf("%lld ", n);
    if (bott)
      printf("0\n");
    else
      printf("%lld\n", m);
  }
}
