/* Calculeaza perechea (x, y) care satisface relatia Ax + By = gcd(A, B) folosind recursivitatea */
#include <stdio.h>

int gcd(int A, int B, int &X, int &Y)
{
    if (B == 0)
    {
        X = 1;
        Y = 0;
        return A;
    }
    else
    {
        int X0, Y0, D;
        D = gcd(B, A % B, X0, Y0);
        X = Y0;
        Y = X0 - (A / B) * Y0;
        return D;
    }
}

int main()
{
    int T, A, B, C, D, X, Y;
    freopen("euclid3.in","r",stdin);
    freopen("euclid3.out","w",stdout);
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d %d %d", &A, &B, &C);
        int D = gcd(A, B, X, Y);

        if (C % D != 0)
        {
            printf("0 0\n");
        }
        else
        {
            printf("%d %d\n", X * (C / D), Y * (C / D));
        }
    }
}