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 gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
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, y, x);
  y -= (a / b) * x;
  return r;
}
bool linear_equation(int a, int b, int c, long long &x, long long &y) {
  long long d = exgcd(a, b, x, y);
  if (c % d != 0) return false;
  long long k = c / d;
  x *= k;
  y *= k;
  return true;
}
int main() {
  int a = 0, b = 0, c = 0;
  long long x = 0, y = 0;
  while (cin >> a >> b >> c) {
    if (!linear_equation(a, b, c, x, y))
      cout << -1 << endl;
    else
      cout << -x << ' ' << -y << endl;
  }
}