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

### Prompt

Please formulate 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;
long long x, y;
void gcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    gcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
int main() {
  long long a, b, c;
  while (cin >> a >> b >> c) {
    c = -c;
    long long r;
    gcd(a, b, r, x, y);
    if (c % r != 0) {
      puts("-1");
      continue;
    } else {
      if (r < 0) {
        x = -x;
        y = -y;
        r = -r;
      }
      x = x * (c / r);
      y = y * (c / r);
      cout << x << " " << y << endl;
    }
  }
  return 0;
}

```