#include <bits/stdc++.h>
using namespace std;
long long x, y, g;
void gcd(long long a, long long b) {
  if (!b) {
    x = 1, y = 0, g = a;
  } else {
    gcd(b, a % b);
    long long tmp = x;
    x = y;
    y = tmp - a / b * y;
  }
}
long long TC(long long x, long long y) {
  if (x < 0) {
    long long xx = -x;
    long long tmp = (xx + y - 1) / y;
    x = x + y * tmp;
  }
  x = x % y;
  if (abs(x - y) < x) x = x - y;
  return x;
}
int main() {
  long long a, b, c;
  long long xx = 1, yy = 1;
  cin >> a >> b >> c;
  if (a == 0) {
    if (c % b)
      printf("-1");
    else {
      cout << "0"
           << " " << -c / b;
    }
    return 0;
  }
  if (b == 0) {
    if (c % a)
      printf("-1");
    else {
      cout << -c / a << " "
           << "0";
    }
    return 0;
  }
  c = -c;
  gcd(a, b);
  if (c % g) {
    printf("-1");
    return 0;
  } else {
    long long tmp = g;
    gcd(a / g, b / g);
    g = tmp;
    x = TC(x, b / g);
    y = (1 - a / g * x) / (b / g);
    x *= xx;
    y *= yy;
    cout << c / g * x << " " << c / g * y;
  }
}

### Prompt

Create a solution in cpp for 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, g;
void gcd(long long a, long long b) {
  if (!b) {
    x = 1, y = 0, g = a;
  } else {
    gcd(b, a % b);
    long long tmp = x;
    x = y;
    y = tmp - a / b * y;
  }
}
long long TC(long long x, long long y) {
  if (x < 0) {
    long long xx = -x;
    long long tmp = (xx + y - 1) / y;
    x = x + y * tmp;
  }
  x = x % y;
  if (abs(x - y) < x) x = x - y;
  return x;
}
int main() {
  long long a, b, c;
  long long xx = 1, yy = 1;
  cin >> a >> b >> c;
  if (a == 0) {
    if (c % b)
      printf("-1");
    else {
      cout << "0"
           << " " << -c / b;
    }
    return 0;
  }
  if (b == 0) {
    if (c % a)
      printf("-1");
    else {
      cout << -c / a << " "
           << "0";
    }
    return 0;
  }
  c = -c;
  gcd(a, b);
  if (c % g) {
    printf("-1");
    return 0;
  } else {
    long long tmp = g;
    gcd(a / g, b / g);
    g = tmp;
    x = TC(x, b / g);
    y = (1 - a / g * x) / (b / g);
    x *= xx;
    y *= yy;
    cout << c / g * x << " " << c / g * y;
  }
}

```