#include <bits/stdc++.h>
using namespace std;
long long a, b, x, y, c, d;
void gcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
    return;
  }
  gcd(b, a % b, y, x);
  y -= (a / b) * x;
}
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  c = -c;
  gcd(a, b, x, y);
  if (c % d) {
    printf("-1");
    return 0;
  }
  printf("%lld %lld", x * c / d, y * c / d);
  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 a, b, x, y, c, d;
void gcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
    return;
  }
  gcd(b, a % b, y, x);
  y -= (a / b) * x;
}
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  c = -c;
  gcd(a, b, x, y);
  if (c % d) {
    printf("-1");
    return 0;
  }
  printf("%lld %lld", x * c / d, y * c / d);
  return 0;
}

```