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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void ext(long long int a, long long int b, long long int &d, long long int &x,
         long long int &y) {
  if (b) {
    ext(b, a % b, d, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
    d = a;
  }
}
int main() {
  int i, j, k;
  long long int A, B, C, x, y, d;
  scanf("%I64d%I64d%I64d", &A, &B, &C);
  ext(A, B, d, x, y);
  if ((-C) % d == 0) {
    printf("%I64d %I64d", (-C) / d * x, (-C) / d * y);
  } else {
    printf("-1");
  }
  return 0;
}