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;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
inline long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1;
    y = 0;
    return a;
  }
  long long gcd = exgcd(b, a % b, x, y);
  long long z = x;
  x = y;
  y = z - a / b * y;
  return gcd;
}
signed main() {
  long long A, B, C;
  A = read();
  B = read();
  C = -read();
  long long x = 0, y = 0;
  long long gcd = exgcd(A, B, x, y);
  if (C % gcd != 0)
    printf("-1\n");
  else {
    x = C / gcd * x;
    y = C / gcd * y;
    printf("%lld %lld\n", x, y);
  }
  return 0;
}