Problem: Consider a [billiard table](https://en.wikipedia.org/wiki/Billiard_table) of rectangular size n × m with four pockets. Let's introduce a coordinate system with the origin at the lower left corner (see the picture). 

<image>

There is one ball at the point (x, y) currently. Max comes to the table and strikes the ball. The ball starts moving along a line that is parallel to one of the axes or that makes a 45^{\circ} angle with them. We will assume that: 

  1. the angles between the directions of the ball before and after a collision with a side are equal, 
  2. the ball moves indefinitely long, it only stops when it falls into a pocket, 
  3. the ball can be considered as a point, it falls into a pocket if and only if its coordinates coincide with one of the pockets, 
  4. initially the ball is not in a pocket. 



Note that the ball can move along some side, in this case the ball will just fall into the pocket at the end of the side.

Your task is to determine whether the ball will fall into a pocket eventually, and if yes, which of the four pockets it will be.

Input

The only line contains 6 integers n, m, x, y, v_x, v_y (1 ≤ n, m ≤ 10^9, 0 ≤ x ≤ n; 0 ≤ y ≤ m; -1 ≤ v_x, v_y ≤ 1; (v_x, v_y) ≠ (0, 0)) — the width of the table, the length of the table, the x-coordinate of the initial position of the ball, the y-coordinate of the initial position of the ball, the x-component of its initial speed and the y-component of its initial speed, respectively. It is guaranteed that the ball is not initially in a pocket.

Output

Print the coordinates of the pocket the ball will fall into, or -1 if the ball will move indefinitely.

Examples

Input

4 3 2 2 -1 1


Output

0 0

Input

4 4 2 0 1 1


Output

-1

Input

10 10 10 1 -1 0


Output

-1

Note

The first sample: 

<image>

The second sample: 

<image>

In the third sample the ball will never change its y coordinate, so the ball will never fall into a pocket.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int egcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  int g = egcd(b, a % b, y, x);
  y -= (a / b) * x;
  return g;
}
long long mlt(long long a, long long b, long long mod) {
  a = (a % mod + mod) % mod;
  b = (b % mod + mod) % mod;
  long long ret = 0;
  while (a > 0) {
    if (a & 1) ret = (ret + b) % mod;
    a >>= 1;
    b = (b + b) % mod;
  }
  return ret;
}
bool solve(int n, int m, int x, int y, int vx, int vy, int &px, int &py) {
  if (vx < 0) {
    if (!solve(n, m, n - x, y, -vx, vy, px, py)) return false;
    px = n - px;
    return true;
  }
  if (vy < 0) {
    if (!solve(n, m, x, m - y, vx, -vy, px, py)) return false;
    py = m - py;
    return true;
  }
  if (vx == 1 && vy == 0) {
    if (y == 0 || y == m) {
      px = n, py = y;
      return true;
    }
    return false;
  }
  if (vx == 0 && vy == 1) {
    if (x == 0 || x == n) {
      px = x, py = m;
      return true;
    }
    return false;
  }
  if (vx == 1 && vy == 1) {
    int a, b, g = egcd(n, m, a, b);
    long long mod = (long long)n * m / g;
    int u = n - x, v = m - y;
    if (u % g != v % g) return false;
    long long t = (u % g) + mlt(u / g, (long long)b * m, mod) +
                  mlt(v / g, (long long)a * n, mod);
    t = (t % mod + mod) % mod;
    px = (x + t) % (2 * n), py = (y + t) % (2 * m);
    return true;
  }
  assert(false);
  return false;
}
void run() {
  int n, m, x, y, vx, vy;
  scanf("%d%d%d%d%d%d", &n, &m, &x, &y, &vx, &vy);
  int px, py;
  if (!solve(n, m, x, y, vx, vy, px, py))
    printf("-1\n");
  else
    printf("%d %d\n", px, py);
}
int main() {
  run();
  return 0;
}