#include <bits/stdc++.h>
using namespace std;
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1, y = 0;
    return a;
  }
  long long res = exgcd(b, a % b, x, y), t = x;
  x = y;
  y = t - a / b * y;
  return res;
}
long long n, m, x, y, vx, vy;
int main() {
  cin >> n >> m >> x >> y >> vx >> vy;
  if ((x == 0 || x == n) && (y == 0 || y == m)) {
    printf("%lld %lld\n", x, y);
    return 0;
  }
  if (!vx) {
    if (x != 0 && x != n)
      puts("-1");
    else if (vy == 1)
      printf("%lld %lld", x, m);
    else
      printf("%lld %lld", x, 0ll);
    return 0;
  }
  if (!vy) {
    if (y != 0 && y != m)
      puts("-1");
    else if (vx == 1)
      printf("%lld %lld", n, y);
    else
      printf("%lld %lld", 0ll, y);
    return 0;
  }
  if (vx == 1) x = n - x;
  if (vy == 1) y = m - y;
  long long a, b, c = y - x;
  long long g = exgcd(n, m, a, b);
  if (c % g != 0) {
    puts("-1");
    return 0;
  }
  a *= c / g, b *= c / g;
  b = -b, c /= g;
  long long tn = n / g, tm = m / g;
  long long a1 = (a % tm + tm) % tm, b1 = (tn * a1 - c) / tm;
  if (b1 < 0) {
    long long t = abs(b1) / tn + (abs(b1) % tn != 0);
    b1 += t * tn;
    a1 += t * tm;
  }
  long long ansx, ansy;
  if (a1 & 1) {
    if (vx == 1)
      ansx = 0;
    else
      ansx = n;
  } else {
    if (vx == 1)
      ansx = n;
    else
      ansx = 0;
  }
  if (b1 & 1) {
    if (vy == 1)
      ansy = 0;
    else
      ansy = m;
  } else {
    if (vy == 1)
      ansy = m;
    else
      ansy = 0;
  }
  printf("%lld %lld\n", ansx, ansy);
  return 0;
}
