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;
pair<long long, pair<long long, long long> > gcd(long long a, long long b) {
  if (a == 0)
    return make_pair(b, make_pair(0, 1));
  else {
    pair<long long, pair<long long, long long> > x = gcd(b % a, a);
    return make_pair(
        x.first,
        make_pair(x.second.second - (b / a) * x.second.first, x.second.first));
  }
}
int main() {
  long long a, b, c;
  scanf("%lld%lld%lld", &a, &b, &c);
  pair<long long, pair<long long, long long> > g = gcd(a, b);
  long long gg = g.first;
  long long x = g.second.first;
  long long y = g.second.second;
  if (c % gg != 0)
    printf("-1\n");
  else {
    x *= c / gg;
    y *= c / gg;
    if (x > 5 * 1000000000000000000LL || x < -5 * 1000000000000000000LL ||
        y > 5 * 1000000000000000000LL || y < -5 * 1000000000000000000LL)
      printf("-1\n");
    else
      printf("%lld %lld\n", -x, -y);
  }
  return 0;
}