#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("euclid3.in");
ofstream gg("euclid3.out");

int t,a,b,c;
struct tuplu{ 
	int x,y; 
	tuplu(int x0=0, int y0=0){ x=x0; y=y0; }
	tuplu(const tuplu& a){ x=a.x; y=a.y; }
};
tuplu operator-(tuplu a, tuplu b){ return tuplu(a.x-b.x, a.y-b.y); }
tuplu operator*(int a, tuplu b){ return tuplu(a*b.x, a*b.y); }

int gcd(int a,int b, tuplu& p){
	int q,r;
	tuplu vr, va(1,0), vb(0,1);
	while(b!=0){
		q=a/b;
		r=a%b;
		a=b;
		b=r;
		vr=va-q*vb;
		va=vb;
		vb=vr;
	}
	p=va;
	return a;
}

int main(){
	int d;
	tuplu p;
	ff >> t;
	while(t--){
		ff >> a >> b >> c;
		d = gcd(a,b,p);
		if(c%d) gg << "0 0\n"; else
			gg << (c/d)*p.x << " " << (c/d)*p.y << "\n";
	}	
	return 0;
}