#include <bits/stdc++.h>
using namespace std;
long long A, B, C, X, Y;
inline long long Ex_GCD(long long L, long long R) {
  if (!R) {
    X = 1;
    Y = 0;
    return L;
  }
  long long Res = Ex_GCD(R, L % R);
  long long Temp = X;
  X = Y;
  Y = Temp - (L / R) * Y;
  return Res;
}
inline void MLE(long long L, long long R, long long N) {
  long long Res = Ex_GCD(L, R);
  if (N % Res) {
    cout << "-1" << endl;
    return;
  }
  long long X0 = X * (N / Res), Y0 = Y * (N / Res);
  cout << X0 << " " << Y0 << endl;
}
int main() {
  scanf("%lld %lld %lld", &A, &B, &C);
  MLE(A, B, -C);
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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, X, Y;
inline long long Ex_GCD(long long L, long long R) {
  if (!R) {
    X = 1;
    Y = 0;
    return L;
  }
  long long Res = Ex_GCD(R, L % R);
  long long Temp = X;
  X = Y;
  Y = Temp - (L / R) * Y;
  return Res;
}
inline void MLE(long long L, long long R, long long N) {
  long long Res = Ex_GCD(L, R);
  if (N % Res) {
    cout << "-1" << endl;
    return;
  }
  long long X0 = X * (N / Res), Y0 = Y * (N / Res);
  cout << X0 << " " << Y0 << endl;
}
int main() {
  scanf("%lld %lld %lld", &A, &B, &C);
  MLE(A, B, -C);
  return 0;
}

```