#ifdef ONLINE_JUDGE
	#include <bits/stdc++.h>
#else
	#include <algorithm>
	#include <bitset>
	#include <cassert>
	#include <cmath>
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <iostream>
	#include <map>
	#include <set>
	#include <stack>
	#include <string>
	#include <utility>
	#include <vector>
	#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

int N;

tuple <int, int, int> GcdExtended(int a, int b);

void Solve(int a, int b, int c) {
	if (a == 0 && b == 0) {
		printf("0 0\n");
		return;
	}
	
	if (a == 0) {
		if (c % b == 0) {
			printf("0 %d\n", c / b);
			return;
		}
		else {
			printf("0 0\n");
			return;
		}
	}
	
	if (b == 0) {
		if (c % a == 0) {
			printf("%d 0\n", c / a);
			return;
		}
		else {
			printf("0 0\n");
			return;
		}
	}
	
	LL x, y, gcd;
	tie(x, y, gcd) = GcdExtended(a, b);
	
	if (0 != c % gcd) {
		printf("0 0\n");
		return;
	}
	
	printf("%d %d\n", x * (c / gcd), y * (c / gcd));
}

tuple <int, int, int> GcdExtended(int a, int b) {
	pair <int, int> p1, p2, p3;
	int rem, quo;
	p1 = mp(1, 0);
	p2 = mp(0, 1);
	while (b) {
		quo = a / b;
		rem = a % b;
		if (rem == 0) {
			break;
		}
		a = b;
		b = rem;
		
		p3.first = p1.first - quo * p2.first;
		p3.second = p1.second - quo * p2.second;
		p1 = p2;
		p2 = p3;
	}
	return mt(p3.first, p3.second, b);
}

int main(){
	string file_input = "euclid3";
#ifdef INFOARENA
	freopen((file_input + ".in").c_str(), "r", stdin);
	freopen((file_input + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("input.cpp", "r", stdin);
#endif
#endif
	
	int i, a, b, c;
	
	ReadNo(N);
	for (i = 0; i < N; ++i) {
		ReadNo(a); ReadNo(b); ReadNo(c);
		Solve(a, b, c);
		Duxar;
	}
	
	return 0;
}