function gcd(a,b:integer; var x,y:integer):integer;
var x0,y0,d:integer;
begin
  if b=0 then begin x:=1; y:=0; gcd:=a; end else
  begin
    d:=gcd(b,a mod b, x0,y0);
    x:=y0;
    y:=x0- (a div b)*y0;
    gcd:=d;
  end;
end;

var t,i,a,b,c,d,x,y:integer;

begin
  assign(input,'euclid3.in');
  assign(output,'euclid3.out');
  readln(t);
  for i:=1 to t do
  begin
    read(a,b,c);
    d:=gcd(a,b,x,y);
    if c mod d <>0 then writeln('0 0') else writeln(x*(c div d),' ',y*(c div d));
  end;
end.
// Varianta C++
//#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;
//}