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;
const long long N = 5e2 + 5;
const long long mod = 1e9 + 7;
long long first, second, z, n, m, k, t;
long long a[N];
long long mn;
string s[N];
bitset<N> b[20];
vector<string> v;
long long exgcd(long long a, long long b, long long &first, long long &second) {
  if (b == 0) {
    first = 1, second = 0;
    return a;
  }
  long long t = exgcd(b, a % b, second, first);
  second -= a / b * first;
  return t;
}
void solve(long long ans = 0) {
  long long a, b, c;
  cin >> a >> b >> c;
  long long t = exgcd(a, b, first, second);
  if (c % t)
    cout << -1 << '\n';
  else
    cout << first * -c / t << ' ' << second * -c / t << '\n';
}
signed main() {
  ios::sync_with_stdio(false);
  solve();
}