#include <bits/stdc++.h>
void e_gcd(long long a, long long b, long long &aa, long long &bb,
           long long &d) {
  if (b == 0) {
    aa = 1;
    bb = 0;
    d = a;
    return;
  }
  e_gcd(b, a % b, aa, bb, d);
  long long tt;
  tt = aa;
  aa = bb;
  bb = tt - (a / b) * bb;
}
int main() {
  long long a, b, c;
  while (~scanf("%lld%lld%lld", &a, &b, &c)) {
    long long l, r;
    l = a;
    r = b;
    long long d;
    e_gcd(l, r, a, b, d);
    if (c % d != 0)
      printf("-1\n");
    else
      printf("%lld %lld\n", -a * (c / d), -b * (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>
void e_gcd(long long a, long long b, long long &aa, long long &bb,
           long long &d) {
  if (b == 0) {
    aa = 1;
    bb = 0;
    d = a;
    return;
  }
  e_gcd(b, a % b, aa, bb, d);
  long long tt;
  tt = aa;
  aa = bb;
  bb = tt - (a / b) * bb;
}
int main() {
  long long a, b, c;
  while (~scanf("%lld%lld%lld", &a, &b, &c)) {
    long long l, r;
    l = a;
    r = b;
    long long d;
    e_gcd(l, r, a, b, d);
    if (c % d != 0)
      printf("-1\n");
    else
      printf("%lld %lld\n", -a * (c / d), -b * (c / d));
  }
  return 0;
}

```