//Code by Patcas Csaba
//Time complexity:
//Space complexity:
//Method:
//Implementation time: 

#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define FORI(it, X) for(__typeof((X).begin()) it = (X).begin(); it !=(X).end(); ++it) 
#define REPEAT do{ 
#define UNTIL(x) }while(!(x)); 

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()

#define IN_FILE "euclid3.in"
#define OUT_FILE "euclid3.out"

ifstream fin(IN_FILE);
ofstream fout(OUT_FILE);

int test;
int a0, b0, c0;

pair<int, PII> doEuclidExtins(int a, int b)
{
  if (b == 0) return MP(a, MP(1, 0));
  else 
  {
    pair<int, PII> aux = doEuclidExtins(b, a % b);
    return MP(aux.X, MP(aux.Y.Y, aux.Y.X - a / b * aux.Y.Y));
  }
}

int main()
{
	//Read data
  fin >> test;
  FORN(t, test)
  {
    fin >> a0 >> b0 >> c0;
    pair<int, PII> aux = doEuclidExtins(a0, b0);
    if (c0 % aux.X != 0) fout << "0 0" << endl;
    else fout << aux.Y.X * (c0 / aux.X) << " " << aux.Y.Y * (c0 / aux.X) << endl;
  }
	fin.close();

	//Solve
  
	//Write data
	fout.close();

	return 0;
}