#include <bits/stdc++.h>
using namespace std;
long long ans1, ans2, ans3;
void solve(long long x, long long y) {
  if (y == 0) {
    ans3 = x;
    ans1 = 1;
    ans2 = 0;
    return;
  }
  solve(y, x % y);
  long long x2 = ans1;
  ans1 = ans2;
  ans2 = x2 - (x / y) * ans2;
}
long long ceil(long long x, long long y) {
  if (x % y == 0) {
    return x / y;
  }
  return x / y + 1;
}
signed main() {
  long long n, i, j, k, l, a, b, x, y, m, now = 0;
  cin >> n >> m >> x >> y >> a >> b;
  if (a == 0) {
    if (b == -1) {
      if (x == n || x == 0) {
        cout << x << ' ' << 0;
      } else {
        cout << -1;
      }
    } else {
      if (x == n || x == 0) {
        cout << x << ' ' << m;
      } else {
        cout << -1;
      }
    }
    return 0;
  }
  if (b == 0) {
    if (a == -1) {
      if (y == m || y == 0) {
        cout << 0 << ' ' << y;
      } else {
        cout << -1;
      }
    } else {
      if (y == m || y == 0) {
        cout << n << ' ' << y;
      } else {
        cout << -1;
      }
    }
    return 0;
  }
  if (a == -1) {
    now -= x;
  } else {
    now -= (n - x);
  }
  if (b == -1) {
    now += y;
  } else {
    now += (m - y);
  }
  solve(n, m);
  if (now % ans3 != 0) {
    cout << -1;
    return 0;
  }
  ans1 *= now / ans3;
  ans2 *= now / ans3;
  if (ans1 < 0) {
    i = ceil(-ans1, m / ans3);
    ans1 += (m / ans3) * i;
    ans2 -= (n / ans3) * i;
  }
  i = ans1 / (m / ans3);
  ans1 -= (m / ans3) * i;
  ans2 += (n / ans3) * i;
  ans2 *= -1;
  if (a == -1) {
    if (ans1 % 2 == 0) {
      ans1 = 0;
    } else {
      ans1 = n;
    }
  } else {
    if (ans1 % 2 == 0) {
      ans1 = n;
    } else {
      ans1 = 0;
    }
  }
  if (b == -1) {
    if (ans2 % 2 == 0) {
      ans2 = 0;
    } else {
      ans2 = m;
    }
  } else {
    if (ans2 % 2 == 0) {
      ans2 = m;
    } else {
      ans2 = 0;
    }
  }
  cout << ans1 << ' ' << ans2;
}
