#include <bits/stdc++.h>

using namespace std;

pair<long long,long long> euclid_extended(int x,int y)
{
    if(y == 0)
        return {1,0};
    auto p = euclid_extended(y,x%y);
    return {p.second, p.first - (x/y)*p.second };
}

long long gcd(long long a,long long b)
{
    if(!b)
        return a;
    return gcd(b, a % b);
}

int main()
{
    freopen("euclid3.in","r",stdin);
    freopen("euclid3.out","w",stdout);

    int T;
    long long A,B,C;
    scanf("%d",&T);

    while(T--)
    {
        scanf("%lld%lld%lld",&A,&B,&C);
        long long D = gcd(A,B);
        if(C % D != 0)
            printf("0 0\n");
        else
        {
            auto p = euclid_extended(A,B);
            printf("%lld %lld\n",p.first*C/D,p.second*C/D);
        }
    }

    return 0;
}