#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
inline void solve(), read();
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  read();
  solve();
  return 0;
}
long long n, m, x, y, vx, vy;
long long ifs() {
  if (vx == 0 && vy != 0) {
    if (x == 0) {
      cout << 0 << " ";
      if (vy > 0) {
        cout << m;
      } else if (vy < 0) {
        cout << 0;
      }
    } else if (x == n) {
      cout << n << " ";
      if (vy > 0) {
        cout << m;
      } else if (vy < 0) {
        cout << 0;
      }
    } else {
      cout << -1;
    }
    return 1;
  }
  if (vx != 0 && vy == 0) {
    if (y == 0) {
      if (vx > 0) {
        cout << n;
      } else if (vx < 0) {
        cout << 0;
      }
      cout << " " << 0;
    } else if (y == m) {
      if (vx > 0) {
        cout << n;
      } else if (vx < 0) {
        cout << 0;
      }
      cout << " " << m;
    } else {
      cout << -1;
    }
    return 1;
  }
  return 0;
}
pair<long long, long long> euclide(long long a, long long b) {
  if (b == 0) {
    return {1, 0};
  }
  pair<long long, long long> e = euclide(b, a % b);
  long long x1, y1;
  tie(x1, y1) = e;
  long long x = y1;
  long long y = x1 - a / b * y1;
  return {x, y};
}
long long gcd(long long a, long long b) {
  while (b != 0) {
    a %= b;
    swap(a, b);
  }
  return a;
}
inline void solve() {
  if (ifs()) {
    return;
  }
  long long tx = 0, ty = 0;
  if (vx == -1) {
    x = n - x;
    tx = 1;
  }
  if (vy == -1) {
    y = m - y;
    ty = 1;
  }
  long long g = gcd(n, m);
  if ((y - x) % g != 0) {
    cout << -1 << "\n";
    return;
  }
  long long x1, y1;
  tie(x1, y1) = euclide(n, m);
  long long c = (x - y) / g;
  long long n1 = n / g, m1 = m / g;
  x1 *= c, y1 *= c;
  long long x2 = (x1 % m1 + m1) % m1;
  if (x2 == 0) {
    x2 = m1;
  }
  long long y2 = -((x - y) - n * x2) / m;
  x2 += tx, y2 += ty;
  if (x2 % 2 == 0) {
    cout << 0;
  } else {
    cout << n;
  }
  cout << " ";
  if (y2 % 2 == 0) {
    cout << 0;
  } else {
    cout << m;
  }
}
inline void read() { cin >> n >> m >> x >> y >> vx >> vy; }
