#include <bits/stdc++.h>
using namespace std;
long long exgcd(long long a, long long b, long long& x, long long& y) {
  if (!b) {
    x = 1;
    y = 0;
    return a;
  }
  int r = exgcd(b, a % b, y, x);
  y -= a / b * x;
  return r;
}
long long A, B, C, x, y;
int main() {
  scanf("%lld%lld%lld", &A, &B, &C);
  C *= -1;
  long long E = exgcd(A, B, x, y);
  if (C % E) {
    printf("-1\n");
    return 0;
  }
  printf("%lld %lld\n", x * C / E, y * C / E);
  return 0;
}

### Prompt

Please create a solution in cpp 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 exgcd(long long a, long long b, long long& x, long long& y) {
  if (!b) {
    x = 1;
    y = 0;
    return a;
  }
  int r = exgcd(b, a % b, y, x);
  y -= a / b * x;
  return r;
}
long long A, B, C, x, y;
int main() {
  scanf("%lld%lld%lld", &A, &B, &C);
  C *= -1;
  long long E = exgcd(A, B, x, y);
  if (C % E) {
    printf("-1\n");
    return 0;
  }
  printf("%lld %lld\n", x * C / E, y * C / E);
  return 0;
}

```