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;
struct t {
  long long x, y, g;
};
void gcd(long long a, long long b, t &z) {
  if (!a) {
    z.x = 0LL;
    z.y = 1LL;
    z.g = b;
    return;
  }
  gcd(b % a, a, z);
  long long temp = z.x;
  z.x = z.y - (b / a) * z.x;
  z.y = temp;
}
int main() {
  t z;
  long long A, B, C;
  scanf("%I64d%I64d%I64d", &A, &B, &C);
  gcd(A, B, z);
  long long t = -C / z.g;
  if (C % z.g)
    printf("%d", -1);
  else
    printf("%I64d %I64d", t * z.x, t * z.y);
}