#include <bits/stdc++.h>
int extgcd(int a, int b, long long& x, long long& y) {
  int d = a;
  if (b == 0) {
    x = 1;
    y = 0;
  } else {
    d = extgcd(b, a % b, y, x);
    y -= a / b * x;
  }
  return d;
}
int main() {
  int A, B, C, d;
  long long x, y;
  scanf("%d %d %d", &A, &B, &C);
  d = extgcd(A, B, x, y);
  x *= (-C / d);
  y *= (-C / d);
  if (C % d)
    printf("-1\n");
  else
    printf("%I64d %I64d\n", x, y);
  return 0;
}

### Prompt

Your task is to create 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>
int extgcd(int a, int b, long long& x, long long& y) {
  int d = a;
  if (b == 0) {
    x = 1;
    y = 0;
  } else {
    d = extgcd(b, a % b, y, x);
    y -= a / b * x;
  }
  return d;
}
int main() {
  int A, B, C, d;
  long long x, y;
  scanf("%d %d %d", &A, &B, &C);
  d = extgcd(A, B, x, y);
  x *= (-C / d);
  y *= (-C / d);
  if (C % d)
    printf("-1\n");
  else
    printf("%I64d %I64d\n", x, y);
  return 0;
}

```