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 int low, hi;
long long int x, y;
long long int A, B, C;
void egcd(long long int A, long long int B, long long int& d, long long int& u,
          long long int& v) {
  long long int a = A, b = B, u1 = 1, v1 = 0, u2 = 0, v2 = 1;
  while (b) {
    long long int k = a / b;
    long long int t;
    t = u1 - u2 * k;
    u1 = u2;
    u2 = t;
    t = v1 - v2 * k;
    v1 = v2;
    v2 = t;
    t = a - b * k;
    a = b;
    b = t;
  }
  d = a;
  u = u1;
  v = v1;
}
void meterx() {
  if (x > hi) {
    int delta = (x - hi + abs(B) - 1) / abs(B);
    x -= delta * abs(B);
    y += delta * abs(A);
  } else if (x < low) {
    int delta = (low - x + abs(B) - 1) / abs(B);
    x += delta * abs(B);
    y -= delta * abs(A);
  }
}
void metery() {
  if (y > hi) {
    int delta = (y - hi + abs(A) - 1) / abs(A);
    y -= delta * abs(A);
    x += delta * abs(B);
  } else if (y < low) {
    int delta = (low - y + abs(A) - 1) / abs(A);
    y += delta * abs(A);
    x -= delta * abs(B);
  }
}
int main() {
  cin >> A >> B >> C;
  long long int d, x, y;
  egcd(A, B, d, x, y);
  if (C % d != 0) {
    cout << -1 << endl;
    return 0;
  }
  x *= -(C / d);
  y *= -(C / d);
  low = -5000000000000000000, hi = -low;
  meterx();
  metery();
  if (min(x, y) > hi || max(x, y) < low)
    cout << -1 << endl;
  else
    cout << x << " " << y << endl;
  return 0;
}