#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
void extgcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  extgcd(b, a % b, x, y);
  long long int tmp = x;
  x = y;
  y = tmp - (a / b) * y;
}
int main() {
  long long int a, b, c, w, x, y;
  while (cin >> a >> b >> c) {
    c = -c;
    w = gcd(a, b);
    if (c % w) {
      cout << "-1";
      continue;
    }
    a = a / w;
    b = b / w;
    c = c / w;
    extgcd(a, b, x, y);
    cout << x * c << " " << y * c << endl;
  }
  return 0;
}

### Prompt

Please provide a cpp coded solution 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 int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
void extgcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  extgcd(b, a % b, x, y);
  long long int tmp = x;
  x = y;
  y = tmp - (a / b) * y;
}
int main() {
  long long int a, b, c, w, x, y;
  while (cin >> a >> b >> c) {
    c = -c;
    w = gcd(a, b);
    if (c % w) {
      cout << "-1";
      continue;
    }
    a = a / w;
    b = b / w;
    c = c / w;
    extgcd(a, b, x, y);
    cout << x * c << " " << y * c << endl;
  }
  return 0;
}

```