#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}

//INSERT ABOVE HERE
const Int mod = 1000003;

Int mod_pow(Int x,Int y){
  Int res = 1;
  while(y){
    if(y % 2) res = res * x % mod;
    x = x * x % mod;
    y /= 2;
  }
  return res;
}

Int fac(Int n){
  static vector<Int> f;
  if(f.empty()){
    f.resize(2000000);
    f[0] = 1;
    for(Int i=1;i<(Int)f.size();i++) f[i] = f[i-1] * i % mod;
  }
  return f[n];
}

Int inv(Int x){return mod_pow(x%mod, mod - 2);}

Int calc(Int x, Int d, Int n, Int f = 0, Int f2 = 0){
  if(x%mod == 0) return 0;
  if(d%mod == 0) return mod_pow(x, n);
  if(n >= mod) return 0;
  // pr(x, d, n);
  Int dn  = mod_pow(d, n) % mod;
  Int L = x * inv(d) % mod;
  Int R = (x * inv(d) + (n - 1))%mod; //[L , R];
  if(x % d == 0 && x / d <= mod && mod <= x / d + n - 1) return 0 ;
  if(L > R) return 0;
  Int l = fac(L-1);
  Int r = fac(R);
  Int t = r * inv(l) % mod;

  if(f) pr(x * inv(d) % mod, dn, L, R, l, r, t);
  //  if(f2) assert(L <= R);
  return dn * t % mod;
}
Int calc2(Int x,Int d,Int n, Int f = 0){
  Int res = 1;
  for(Int i=0;i<n;i++){
    res *= (x + d * i) % mod, res %= mod;
    //if(f && res) pr(i, x, d, n, f, res);
  }
  return res;
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int Q;
  Int debug = 0;
  if(debug == 0) cin>>Q;
  else Q = 10000000000;
  
  while(Q--){
    Int x, d, n;
    if(debug == 0) cin>>x>>d>>n;
    else x = rand()%(mod+1), d = rand()%(mod+1), n = rand()%10000 + 1;

    Int ans = calc(x, d, n);
    if(debug){
      Int ans2 = calc2(x, d, n);
      if(ans != ans2) pr(x, d, n, ans, ans2), calc(x, d, n, 1);
      if(ans != ans2) calc2(x, d, n, 1);
      assert(ans == ans2);
      //calc(x, d, n, 0, 1);

    }
    if(debug == 0) cout<<ans%mod<<endl;
  }

  
  return 0;
}


Measured memory_bytes: 16512