#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000003;
ll q,x,d,n;
ll fac[2100000];
ll qpow(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1)
			ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
ll inv(ll a){//mod为素数
	return qpow(a,mod-2);
}
ll solve(ll x,ll d){
	if(n>=mod)
		return 0;
	return fac[x+n-1]*inv(fac[x-1])%mod*qpow(d,n)%mod;
}
int main(){
	fac[0]=1;
	for(int i=1;i<2100000;i++)
		fac[i]=fac[i-1]*i%mod;
	scanf("%lld",&q);
	while(q--){
		scanf("%lld%lld%lld",&x,&d,&n);
		if(d==0){
			printf("%lld\n",qpow(x,n));
			continue;
		}
		printf("%lld\n",solve(x*inv(d)%mod,d));
	}
} 