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 ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
inline void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) { write(x), putchar('\n'); }
long long a, b, c, x, y;
inline long long gcd(long long a, long long b) {
  return !b ? a : gcd(b, a % b);
}
inline long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  long long r = exgcd(b, a % b, x, y), tmp = y;
  y = x - (a / b) * y, x = tmp;
  return r;
}
inline long long solve(long long a, long long b, long long c) {
  long long ng = gcd(a, b);
  c = -c;
  if (c % ng != 0) return -1LL;
  long long k = c / ng;
  exgcd(a, b, x, y);
  x *= k, y *= k;
  return 1LL;
}
int main() {
  a = read(), b = read(), c = read();
  if (solve(a, b, c) == -1LL) return puts("-1"), 0;
  write(x), putchar(' '), writeln(y);
  return 0;
}