#include <bits/stdc++.h>
using namespace std;
long long x, y;
long long eGCD(long long a, long long b) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long q, r, ret, aux;
    q = a / b;
    r = a % b;
    ret = eGCD(b, r);
    aux = x;
    x = y;
    y = aux - (q * x);
    return ret;
  }
}
int main() {
  long long a, b, c, gcd, f;
  cin >> a >> b >> c;
  gcd = eGCD(a, b);
  if (abs(-c) % gcd == 0) {
    f = -c / gcd;
    cout << x * f << " " << y * f << endl;
  } else
    cout << -1 << endl;
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long x, y;
long long eGCD(long long a, long long b) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long q, r, ret, aux;
    q = a / b;
    r = a % b;
    ret = eGCD(b, r);
    aux = x;
    x = y;
    y = aux - (q * x);
    return ret;
  }
}
int main() {
  long long a, b, c, gcd, f;
  cin >> a >> b >> c;
  gcd = eGCD(a, b);
  if (abs(-c) % gcd == 0) {
    f = -c / gcd;
    cout << x * f << " " << y * f << endl;
  } else
    cout << -1 << endl;
  return 0;
}

```