#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
long long exgcd(long long a, long long b, long long &X, long long &Y) {
  if (!b) {
    X = 1, Y = 0;
    return a;
  }
  long long ans = exgcd(b, a % b, X, Y);
  long long X1 = X, Y1 = Y;
  X = Y1;
  Y = X1 - a / b * Y1;
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  long long A, B, C, X, Y;
  while (cin >> A >> B >> C) {
    C = -C;
    long long g = exgcd(A, B, X, Y);
    if (C % g) {
      puts("-1");
      continue;
    }
    long long t = C / g;
    X = X * t, Y = Y * t;
    printf("%I64d %I64d\n", X, Y);
  }
  return 0;
}

### Prompt

Generate 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;
const int INF = 0x3f3f3f3f;
long long exgcd(long long a, long long b, long long &X, long long &Y) {
  if (!b) {
    X = 1, Y = 0;
    return a;
  }
  long long ans = exgcd(b, a % b, X, Y);
  long long X1 = X, Y1 = Y;
  X = Y1;
  Y = X1 - a / b * Y1;
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  long long A, B, C, X, Y;
  while (cin >> A >> B >> C) {
    C = -C;
    long long g = exgcd(A, B, X, Y);
    if (C % g) {
      puts("-1");
      continue;
    }
    long long t = C / g;
    X = X * t, Y = Y * t;
    printf("%I64d %I64d\n", X, Y);
  }
  return 0;
}

```