#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int a, b, c, x, y;
long long int ext(long long int a, long long int b, long long int &x,
                  long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int g = ext(b, a % b, y, x);
  y -= (a / b) * x;
  return g;
}
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  long long int gcd = ext(a, b, x, y);
  if (c % gcd)
    cout << "-1";
  else {
    gcd = -c / gcd;
    printf("%lld %lld", x * gcd, y * gcd);
  }
  return 0;
}

### 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;
const int N = 1e5 + 10;
long long int a, b, c, x, y;
long long int ext(long long int a, long long int b, long long int &x,
                  long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int g = ext(b, a % b, y, x);
  y -= (a / b) * x;
  return g;
}
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  long long int gcd = ext(a, b, x, y);
  if (c % gcd)
    cout << "-1";
  else {
    gcd = -c / gcd;
    printf("%lld %lld", x * gcd, y * gcd);
  }
  return 0;
}

```