#include <iostream>

#include <string.h>

#include <algorithm>

#include <stdio.h>

using namespace std;

typedef long long LL;

LL gcd(LL a,LL b)

{

    return b ? gcd(b,a%b):a;

}

void Extend_Euclid(LL a,LL b,LL &x,LL &y)

{

    if(b == )

    {

        x = ;

        y = ;

        return;

    }

    extend_Euclid(b,a%b,x,y);

    LL tmp = x;

    x = y;

    y = tmp - (a / b) * y;

}

int main()

{

    LL a,b,c,x,y;

    while(cin>>a>>b>>c)

    {

        c=-c;

        LL g=gcd(a,b);

        if(c%g)

        {

            printf("-1\n");

            continue;

        }

        extend_Euclid(a,b,x,y);

        printf("%lld %lld\n",x*c,y*c);

    }

    return ;

}