#include <bits/stdc++.h>
using namespace std;
long long int ext_gcd(long long int a, long long int b, long long int& s,
                      long long int& t) {
  if (b == 0) {
    s = 1;
    t = 0;
    return a;
  }
  long long int ans = ext_gcd(b, a % b, s, t);
  long long int tmp = s;
  s = t;
  t = tmp - a / b * s;
  return ans;
}
int main() {
  long long int a, b, c;
  scanf("%I64d %I64d %I64d", &a, &b, &c);
  long long int s = 0, t = 0;
  long long int d = ext_gcd(a, b, s, t);
  if (c % d != 0)
    printf("-1\n");
  else
    printf("%I64d %I64d\n", -1 * c / d * s, -1 * c / d * t);
  return 0;
}

### Prompt

Your task is to create 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 int ext_gcd(long long int a, long long int b, long long int& s,
                      long long int& t) {
  if (b == 0) {
    s = 1;
    t = 0;
    return a;
  }
  long long int ans = ext_gcd(b, a % b, s, t);
  long long int tmp = s;
  s = t;
  t = tmp - a / b * s;
  return ans;
}
int main() {
  long long int a, b, c;
  scanf("%I64d %I64d %I64d", &a, &b, &c);
  long long int s = 0, t = 0;
  long long int d = ext_gcd(a, b, s, t);
  if (c % d != 0)
    printf("-1\n");
  else
    printf("%I64d %I64d\n", -1 * c / d * s, -1 * c / d * t);
  return 0;
}

```