#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
tuple<long long, long long, long long> f(long long a, long long b) {
  long long r, s, t;
  if (b == 0) return make_tuple(a, 1, 0);
  tie(r, s, t) = f(b, a % b);
  return make_tuple(r, t, s - a / b * t);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c, r, s, t;
  cin >> a >> b >> c;
  if (c % gcd(a, b) != 0)
    cout << -1;
  else {
    tie(r, s, t) = f(a, b);
    cout << -c / r * s << ' ' << -c / r * t;
  }
}

### Prompt

In Cpp, your task is to solve 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 gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
tuple<long long, long long, long long> f(long long a, long long b) {
  long long r, s, t;
  if (b == 0) return make_tuple(a, 1, 0);
  tie(r, s, t) = f(b, a % b);
  return make_tuple(r, t, s - a / b * t);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c, r, s, t;
  cin >> a >> b >> c;
  if (c % gcd(a, b) != 0)
    cout << -1;
  else {
    tie(r, s, t) = f(a, b);
    cout << -c / r * s << ' ' << -c / r * t;
  }
}

```