#include <bits/stdc++.h>
using namespace std;
long long ex_gcd(long long a, long long b, long long& x, long long& y) {
  if (a == 0 && b == 0) return -1;
  if (b == 0) {
    x = 1ll;
    y = 0;
    return a;
  }
  long long temp = ex_gcd(b, a % b, y, x);
  y -= a / b * x;
  return temp;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long A, B, C;
  cin >> A >> B >> C;
  C = -C;
  long long xx, yy;
  long long d = ex_gcd(A, B, xx, yy);
  if (C % d)
    cout << -1 << endl;
  else {
    long long bei = C / d;
    cout << bei * xx << " " << bei * yy << endl;
  }
  return 0;
}

### Prompt

Generate a Cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long ex_gcd(long long a, long long b, long long& x, long long& y) {
  if (a == 0 && b == 0) return -1;
  if (b == 0) {
    x = 1ll;
    y = 0;
    return a;
  }
  long long temp = ex_gcd(b, a % b, y, x);
  y -= a / b * x;
  return temp;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long A, B, C;
  cin >> A >> B >> C;
  C = -C;
  long long xx, yy;
  long long d = ex_gcd(A, B, xx, yy);
  if (C % d)
    cout << -1 << endl;
  else {
    long long bei = C / d;
    cout << bei * xx << " " << bei * yy << endl;
  }
  return 0;
}

```