#include <bits/stdc++.h>
using namespace std;
int mod_mult(long long a, long long b, long long m) { return (a * b) % m; }
int gcd(int a, int b) {
  while (b) {
    int c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int phi(int m) {
  int a = m;
  for (int x = 2; x * x <= m; x++) {
    if (m % x == 0) {
      a -= a / x;
      while (m % x == 0) m /= x;
    }
  }
  if (m > 1) {
    a -= a / m;
  }
  return a;
}
int pow(int a, int b, int m) {
  int res = 1;
  while (b) {
    if (b % 2 == 1) {
      res = mod_mult(res, a, m);
    }
    a = mod_mult(a, a, m);
    b /= 2;
  }
  return res;
}
int get(int a, int d, int m) {
  int g = gcd(d, m);
  if (a % g != 0) return -1;
  a /= g;
  d /= g;
  m /= g;
  int k = mod_mult((m - a) % m, pow(d, phi(m) - 1, m), m);
  return k;
}
int main() {
  int n, m, x, y, vx, vy;
  ignore = scanf("%d %d %d %d %d %d", &n, &m, &x, &y, &vx, &vy);
  if (vx == 0) {
    if (x != 0 && x != n)
      printf("-1\n");
    else if (vy > 0)
      printf("%d %d\n", x, m);
    else
      printf("%d %d\n", x, 0);
    return 0;
  }
  if (vy == 0) {
    if (y != 0 && y != m)
      printf("-1\n");
    else if (vx > 0)
      printf("%d %d\n", n, y);
    else
      printf("%d %d\n", 0, y);
    return 0;
  }
  int a = y % m;
  if (vy < 0) a = (m - y) % m;
  if (x != 0 && x != n) {
    if (vx < 0)
      a = (a + x) % m;
    else
      a = (a + n - x) % m;
  }
  int d = n % m;
  int k = get(a, d, m);
  if (k == -1) {
    printf("-1\n");
    return 0;
  }
  long long t = (vx < 0 ? x % n : (n - x) % n) + k * 1LL * n;
  long long xx = x + t * vx;
  long long yy = y + t * vy;
  xx = abs(xx);
  yy = abs(yy);
  xx %= 2 * n;
  yy %= 2 * m;
  printf("%d %d\n", (int)xx, (int)yy);
}
