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;
long long x, y, a, b, c, d;
long long exgcd(long long a, long long b) {
  if (!b) {
    x = 1, y = 0;
    return a;
  }
  long long ans = exgcd(b, a % b);
  long long t = x;
  x = y, y = t - a / b * y;
  return ans;
}
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  d = exgcd(a, b);
  if (-c % d != 0) {
    puts("-1");
    return 0;
  }
  x = -c / d * x, y = -c / d * y;
  printf("%lld %lld", x, y);
  return 0;
}