#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define sc second
#define pb push_back
#define int long long
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
template<typename type>
using ordered_set = tree<type, null_type, less<type>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 3e5 + 5, mod = 1e9 + 7, inf = 2e9;
const int dl[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1};
const int ddl[] = {-1, -1, -1, 0, 1, 1, 1, 0}, ddc[] = {-1, 0, 1, 1, 1, 0, -1, -1};
mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
int rng(int lo = 1, int hi = INT_MAX) {
uniform_int_distribution<int> rnd(lo, hi);
return rnd(gen);
}
struct mint {
int val;
mint(int32_t x = 0) {
val = x % mod;
}
mint(long long x) {
val = x % mod;
}
mint operator+(mint x) {
return val + x.val;
}
mint operator-(mint x) {
return val - x.val + mod;
}
mint operator*(mint x) {
return 1LL * val * x.val;
}
void operator+=(mint x) {
val = (*this + x).val;
}
void operator-=(mint x) {
val = (*this - x).val;
}
void operator*=(mint x) {
val = (*this * x).val;
}
friend auto operator>>(istream& in, mint &x) -> istream& {
in >> x.val;
x.val %= mod;
return in;
}
friend auto operator<<(ostream& out, mint const &x) -> ostream& {
out << x.val;
return out;
}
};
int euclid(int a, int b, int &x, int &y) {
if(!b) {
x = 1, y = 0;
return a;
}
int x1, y1;
int d = euclid(b, a%b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
void tc() {
int a, b, c;
cin >> a >> b >> c;
int x, y, d;
d = euclid(a, b, x, y);
if(c % d)
cout << "0 0\n";
else
cout << x * (c / d) << ' ' << y * (c / d) << '\n';
}
int32_t main() {
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
cin.tie(nullptr)->sync_with_stdio(0);
int tt;
cin >> tt;
while(tt--)
tc();
return 0;
}