#include <fstream>

//gcd = greatest common divisor
//diophantine equation

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()
{
	std::ifstream fin("euclid3.in");
	std::ofstream fout("euclid3.out");

	int t;
	fin >> t;

	for (int i = 0; i < t; i++) {
		int a, b, c;
		fin >> a >> b >> c;
		
		int d, x, y;
		d = gcd(a, b, x, y);

		if (c % d)
			fout << "0 0\n";

		else
			fout << x * (c / d) << " " << y * (c / d) << "\n";
	}

	fin.close(), fout.close();

	return 0;
}