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;
struct Data {
  long long x, y, d;
  Data(long long dd, long long xx, long long yy) {
    x = xx;
    y = yy;
    d = dd;
  }
};
const long long MIN = -5000000000000000000ll;
const long long MAX = 5000000000000000000ll;
Data egcd(long long a, long long b) {
  if (b == 0) return Data(a, 1, 0);
  Data d = egcd(b, a % b);
  return Data(d.d, d.y, d.x - a / b * d.y);
}
void dioph(long long a, long long b, long long c) {
  Data d = egcd(a, b);
  if (c % d.d != 0) {
    cout << -1 << endl;
  } else {
    d.x *= c / d.d;
    d.y *= c / d.d;
    cout << d.x << " " << d.y << endl;
  }
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  dioph(a, b, -c);
  return 0;
}