#include <bits/stdc++.h>

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

const int MOD=1e6+3;
int F[MOD], Finv[MOD];

long long fast_pow(long long a, long long b)
{
	long long ret=1;
	for(;b;b>>=1) {
		if(b&1) ret=(ret*a)%MOD;
		a=(a*a)%MOD;
	}
	return ret;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int Q, X, D, N;
	F[0]=Finv[0]=1;
	for(int i=1;i<MOD;i++) F[i]=(1LL*F[i-1]*i)%MOD;
	Finv[MOD-1]=fast_pow(F[MOD-1],MOD-2);
	for(int i=MOD-2;i;i--) Finv[i]=(1LL*(i+1)*Finv[i+1])%MOD;
	for(cin>>Q;Q;Q--) {
		cin>>X>>D>>N;
		if(D) {
			X=(1LL*X*fast_pow(D,MOD-2))%MOD;
			if(X+N-1>=MOD) cout<<"0\n";
			else {
				int ans=(1LL*F[X+N-1]*Finv[max(X-1,0)])%MOD;
				cout<<(1LL*ans*fast_pow(D,N))%MOD<<'\n';
			}
		}
		else cout<<fast_pow(X,N)<<'\n';
	}
	return 0;
}