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;
using ll = long long;
void dout() { cerr << endl; }
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
  cerr << H << ' ';
  dout(T...);
}
ll euclid(ll a, ll b, ll& x, ll& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  ll xx, yy;
  ll g = euclid(b, a % b, xx, yy);
  x = yy;
  y = xx - a / b * yy;
  return g;
}
bool diophantus(ll a, ll b, ll c, ll& x, ll& y) {
  ll g = euclid(a, b, x, y);
  x *= -c / g;
  y *= -c / g;
  return c % g == 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll a, b, c;
  cin >> a >> b >> c;
  ll x, y;
  bool ans = diophantus(a, b, c, x, y);
  if (ans)
    cout << x << ' ' << y;
  else
    cout << -1;
  return 0;
}