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 A, B, C;
int f;
long long an, bn;
long long _gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long ans = _gcd(b, a % b, x, y);
  long long tmp = x;
  x = y;
  y = tmp - (a / b) * x;
  return ans;
}
void cal(long long a, long long b, long long c) {
  long long x, y;
  long long gcd = _gcd(a, b, x, y);
  if (c % gcd != 0)
    f = 0;
  else {
    f = 1;
    an = x * c / gcd;
    bn = y * c / gcd;
  }
}
int main() {
  while (scanf("%lld%lld%lld", &A, &B, &C) != EOF) {
    f = 0;
    an = 0, bn = 0;
    cal(A, B, -C);
    if (f == 1)
      printf("%lld %lld\n", an, bn);
    else
      printf("-1\n");
  }
  return 0;
}