#include <bits/stdc++.h>
using namespace std;
long long A, B, C, D, X, Y;
inline long long gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long res = gcd(b, a % b, x, y);
  long long t = x;
  x = y;
  y = t - (a / b) * y;
  return res;
}
int main() {
  scanf("%lld %lld %lld", &A, &B, &C);
  D = gcd(A, B, X, Y);
  C = -C;
  if (C % D)
    puts("-1");
  else {
    C /= D;
    printf("%lld %lld\n", X * C, Y * C);
  }
  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;
long long A, B, C, D, X, Y;
inline long long gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long res = gcd(b, a % b, x, y);
  long long t = x;
  x = y;
  y = t - (a / b) * y;
  return res;
}
int main() {
  scanf("%lld %lld %lld", &A, &B, &C);
  D = gcd(A, B, X, Y);
  C = -C;
  if (C % D)
    puts("-1");
  else {
    C /= D;
    printf("%lld %lld\n", X * C, Y * C);
  }
  return 0;
}

```