#include <bits/stdc++.h>

//#pragma GCC target("avx2")
#define int long long
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//using namespace __gnu_pbds;
using namespace std;
//ofstream fout("date.out");
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
//template <class T>
//using Tree =
//    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
int n;
int a,b,c;
void euclide(int a,int b,int &d,int &x,int &y)
{
    if(b==0)
    {
        d=a;
        x=1;
        y=0;
        return;
    }
    int r=a%b;
    euclide(b,r,d,x,y);
    int xx=y;
    int yy=x-(a/b)*xx;
    x=xx;
    y=yy;
}
void solveeq(int a,int b,int c)
{
    int d,x,y;
    euclide(a,b,d,x,y);
    if(c%d!=0)
    {
        fout<<"0 0\n";
        return;
    }
    int mul=c/d;
    int u=a/d;//x creste cu v
    int v=b/d;//y scade cu u
    fout<<mul*x<<' '<<mul*y<<'\n';
}
void solve()
{
    fin>>a>>b>>c;
    solveeq(a,b,c);
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    fin>>t;
    while(t--)
        solve();
    return 0;
}