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 int read() {
  int a = 0, f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) a = (a << 3) + (a << 1) + ch - '0';
  return a * f;
}
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
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 g = exgcd(b, a % b, x, y);
  long long z = y;
  y = x - a / b * y;
  x = z;
  return g;
}
inline bool getans(long long a, long long b, long long c, long long& x,
                   long long& y) {
  long long g = exgcd(a, b, x, y);
  if (c % g) return false;
  long long k = -c / g;
  x *= k;
  y *= k;
  return true;
}
signed main() {
  long long a = read(), b = read(), c = read(), x, y;
  if (getans(a, b, c, x, y))
    printf("%lld %lld\n", x, y);
  else
    puts("-1");
  return 0;
}