#include <bits/stdc++.h>
using namespace std;
long long int extended_gcd(long long int a, long long int b, long long int& x,
                           long long int& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int t = extended_gcd(b, a % b, x, y);
  swap(x, y);
  y = y - (a / b) * x;
  return t;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int a, b, c;
  cin >> a >> b >> c;
  long long int x, y;
  long long int gc = extended_gcd(a, b, x, y);
  if (c % gc)
    cout << "-1";
  else
    cout << -1 * (c / gc) * x << " " << -1 * (c / gc) * y;
  return 0;
}

### Prompt

Please formulate a Cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int extended_gcd(long long int a, long long int b, long long int& x,
                           long long int& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int t = extended_gcd(b, a % b, x, y);
  swap(x, y);
  y = y - (a / b) * x;
  return t;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int a, b, c;
  cin >> a >> b >> c;
  long long int x, y;
  long long int gc = extended_gcd(a, b, x, y);
  if (c % gc)
    cout << "-1";
  else
    cout << -1 * (c / gc) * x << " " << -1 * (c / gc) * y;
  return 0;
}

```