#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("euclid3.in");
ofstream fout("euclid3.out");

int euclid_extins(int a, int b, int &x, int &y)
{
    if(b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    else
    {
        int x0, y0, d;
        d = euclid_extins(b, a%b, x0, y0);
        x = y0;
        y = x0 - (a/b) * y0;
        return d;
    }
}
int main()
{
    int a, b, c, x, y, d, n;
    fin>>n;
    for(int i = 1; i<=n; i++)
    {
        fin>>a>>b>>c;
        d = euclid_extins(a, b, x, y);
        if(c % d)
            fout<<0<<" "<<0;
        else
            fout<<(c/d)*x<<" "<<(c/d) * y;
        fout<<'\n';
    }
    return 0;
}
/*#include <stdio.h>
#include <assert.h>

inline int gcd( int A, int B, int &X, int &Y )
{
	if (B == 0)
	{
		X = 1;
		Y = 0;
		return A;
	}

	int X0, Y0, D;
	D = gcd( B, A % B, X0, Y0 );

	X = Y0;
	Y = X0 - (A / B) * Y0;
	return D;
}

int main()
{
	freopen("euclid3.in", "rt", stdin);
	freopen("euclid3.out", "wt", stdout);

	int T;
	for (scanf("%d", &T), assert( T <= 100 ); T; T--)
	{
		int A, B, C;
		scanf("%d %d %d", &A, &B, &C);

		assert( -1000000000 <= A && A <= 1000000000 );
		assert( -1000000000 <= B && B <= 1000000000 );
		assert( -2000000000 <= C && C <= 2000000000 && C != 0 );
		int D, X, Y;
		D = gcd( A, B, X, Y );

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

	return 0;
}*/