全re，样例过了，求调

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<queue>
#include<vector>
#include<bitset>
#define ll long long
#define INF 2147483647
#define P 100000000
using namespace std;
int T;
ll a,b,c,x,y;
ll read()
{
	c=getchar();
	ll x=0,f=1;
	while(c<'0'||c>'9')
	{
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<1)+(x<<3)+(c-'0');
		c=getchar();
	}
	return x*f;
}
ll exgcd(ll a,ll b)
{
	if(b==0)
	{
		x=1,y=0;
		return a;
	}
	exgcd(b,a%b);
	ll t=x;
	x=y,y=t-a/b*y;
}
ll gcd(ll a,ll b)
{
	if(b==0)return a;
	return gcd(b,a%b);
}
int main()
{
	T=read();
	while(T--)
	{
		a=read(),b=read(),c=read();
		ll d=gcd(a,b);
		if(c%d!=0)
		{
			cout<<"-1"<<endl;
			continue;
		}
		exgcd(a,b);
		x=x*c/d,y=y*c/d;
		ll tx=b/d,ty=a/d;
		ll k=ceil((1.0-x)/tx);
		x+=tx*k,y-=ty*k;
		if(y<=0)
		{
			ll ymin=y+ty*ceil((1.0-y)/ty);
			printf("%lld%lld\n",x,ymin);
		}
		else
		{
			printf("%lld %lld %lld %lld %lld\n",(y-1)/ty+1,x,(y-1)%ty+1,x+(y-1)/ty*tx,y);
		}
	}
	return 0;
}