#include <bits/stdc++.h>
using namespace std;
long long A, B, C, x, y;
long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); }
void exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b)
    x = 1, y = 0;
  else
    exgcd(b, a % b, y, x), y -= (a / b) * x;
}
int main() {
  scanf("%I64d%I64d%I64d", &A, &B, &C);
  C = -C;
  if (B == 0) {
    if (!C) return puts("0 0"), 0;
    if (C % A) return puts("-1"), 0;
    return printf("%I64d %I64d\n", C / A, 0ll);
  }
  if (C % gcd(A, B)) return puts("-1"), 0;
  exgcd(A, B, x, y);
  C /= gcd(A, B);
  x *= C;
  y *= C;
  printf("%I64d %I64d\n", x, y);
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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, C, x, y;
long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); }
void exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b)
    x = 1, y = 0;
  else
    exgcd(b, a % b, y, x), y -= (a / b) * x;
}
int main() {
  scanf("%I64d%I64d%I64d", &A, &B, &C);
  C = -C;
  if (B == 0) {
    if (!C) return puts("0 0"), 0;
    if (C % A) return puts("-1"), 0;
    return printf("%I64d %I64d\n", C / A, 0ll);
  }
  if (C % gcd(A, B)) return puts("-1"), 0;
  exgcd(A, B, x, y);
  C /= gcd(A, B);
  x *= C;
  y *= C;
  printf("%I64d %I64d\n", x, y);
  return 0;
}

```