codefroces 7C

C. Line

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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·10¹⁸ to 5·10¹⁸ inclusive, or to find out that such points do not exist.

Input

The first line contains three integers A, B and C ( - 2·10⁹ ≤ A, B, C ≤ 2·10⁹) — corresponding coefficients of the line equation. It is guaranteed that A² + B² > 0.

Output

If the required point exists, output its coordinates, otherwise output -1.

Examples

Input

2 5 3

Output

6 -3

（哇，第一次在cf上做到模板题

题意：拓展欧几里得求解ax+by=c的模板题

附ac代码：

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int gcd(ll a,ll b)
{
    return b==0?a:gcd(b,a%b);
}
void exgcd(ll a,ll b,ll &x,ll &y)
{
    ll d;
    if(!b)
    {
        d=a;
        x=1;
        y=0;
    }
    else
    {
        exgcd(b,a%b,y,x);
        y-=x*(a/b);
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll a,b,c;
    ll x,y;
    cin>>a>>b>>c;
    c=-c;
    ll d=gcd(a,b);
    if(c%d)
        cout<<-1<<endl;
    else
    {
        a/=d;b/=d;c/=d;
        exgcd(a,b,x,y);
    cout<<x*c<<" "<<y*c<<endl;
    }

    return 0;
}