Problem: A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 inclusive, or to find out that such points do not exist.

Input

The first line contains three integers A, B and C ( - 2·109 ≤ A, B, C ≤ 2·109) — corresponding coefficients of the line equation. It is guaranteed that A2 + B2 > 0.

Output

If the required point exists, output its coordinates, otherwise output -1.

Examples

Input

2 5 3


Output

6 -3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long e_gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long ans = e_gcd(b, a % b, x, y);
  long long temp = x;
  x = y;
  y = temp - a / b * y;
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cout.tie(NULL);
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y;
  long long g = e_gcd(a, b, x, y);
  x = (x * -c) / g;
  y = (y * -c) / g;
  long long t = 0;
  map<long long, bool> book;
  bool pk = false;
  while (true) {
    if (-c % g != 0) {
      pk = true;
      break;
    }
    if (-5000000000000000000 <= x && x <= 5000000000000000000 &&
        -5000000000000000000 <= y && y <= 5000000000000000000)
      break;
    if (x < -5000000000000000000 || y > 5000000000000000000)
      t++;
    else if (x > 5000000000000000000 || y < -5000000000000000000)
      t--;
    if (book[t]) {
      pk = true;
      break;
    }
    book[t] = true;
    x += b * t;
    y -= a * t;
  }
  if (!pk && -5000000000000000000 <= x && x <= 5000000000000000000 &&
      -5000000000000000000 <= y && y <= 5000000000000000000)
    cout << x << ' ' << y << endl;
  else
    cout << -1 << endl;
  return 0;
}