#include <bits/stdc++.h>
using namespace std;
void exgcd(long long a, long long b, long long& x, long long& y) {
  if (!b)
    x = 1, y = 0;
  else
    exgcd(b, a % b, y, x), y -= (a / b) * x;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main(int argc, char* argv[], char* envp[]) {
  long long num1, num2, target, tmp1, tmp2, grtcmdv;
  cin >> num1 >> num2 >> target;
  target *= -1;
  grtcmdv = gcd(num1, num2);
  if (target % grtcmdv) {
    cout << -1;
    return 0;
  }
  exgcd(num1, num2, tmp1, tmp2);
  tmp1 = tmp1 * target / grtcmdv, tmp2 = tmp2 * target / grtcmdv;
  cout << tmp1 << ' ' << tmp2;
  return 0;
}

### Prompt

Your challenge is to write 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;
void exgcd(long long a, long long b, long long& x, long long& y) {
  if (!b)
    x = 1, y = 0;
  else
    exgcd(b, a % b, y, x), y -= (a / b) * x;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main(int argc, char* argv[], char* envp[]) {
  long long num1, num2, target, tmp1, tmp2, grtcmdv;
  cin >> num1 >> num2 >> target;
  target *= -1;
  grtcmdv = gcd(num1, num2);
  if (target % grtcmdv) {
    cout << -1;
    return 0;
  }
  exgcd(num1, num2, tmp1, tmp2);
  tmp1 = tmp1 * target / grtcmdv, tmp2 = tmp2 * target / grtcmdv;
  cout << tmp1 << ' ' << tmp2;
  return 0;
}

```