#include <fstream>
#include <queue>
#include <cmath>
#include <deque>
#include <algorithm>
using namespace std;
ifstream cin("euclid3.in");
ofstream cout("euclid3.out");
void gcd(int a,int b,int &x,int &y,int &c)
{
    if(b==0)
    {
        c=a;
        x=1;
        y=0;
        return;
    }
    int xx,yy,z=a/b;
    gcd(b,a%b,xx,yy,c);
    x=yy;
    y=xx-yy*z;
}
signed main()
{
    int n;
    cin>>n;
    for(;n>0;n--)
    {
        int a,b,c,d,x,y;
        cin>>a>>b>>d;
        gcd(a,b,x,y,c);
        if(d%c!=0)
        {
            cout<<"0 0\n";
        }
        else
        {
            cout<<x*(d/c)<<' '<<y*(d/c)<<'\n';
        }
    }
}