Consider the following arithmetic progression with n terms:

* x, x + d, x + 2d, \ldots, x + (n-1)d



What is the product of all terms in this sequence? Compute the answer modulo 1\ 000\ 003.

You are given Q queries of this form. In the i-th query, compute the answer in case x = x_i, d = d_i, n = n_i.

Constraints

* 1 \leq Q \leq 10^5
* 0 \leq x_i, d_i \leq 1\ 000\ 002
* 1 \leq n_i \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


Q
x_1 d_1 n_1
:
x_Q d_Q n_Q


Output

Print Q lines.

In the i-th line, print the answer for the i-th query.

Example

Input

2
7 2 4
12345 67890 2019


Output

9009
916936
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int maxn=1e6+10;
const int mod=1000003;
ll sum[mod];
ll ni[mod];
ll pows(ll a,ll b)
{
    ll re=1;
    while(b)
    {
        if(b&1)
            re=a*re%mod;
         a=a*a%mod;
         b/=2;
    }
    return re;
}
int main()
{
      int q,x,d,n;
      scanf("%d",&q);
       sum[0]=ni[0]=1;
       for(ll  i=1;i<mod;i++)
       {
           sum[i]=sum[i-1]*i%mod;
           ni[i]=pows(sum[i],mod-2);
       }
       while(q--)
       {
       scanf("%d%d%d",&x,&d,&n);
        if(d==0)
            printf("%lld\n",pows(x,n)%mod);
        else
        {
                 ll xx=x*pows(d,mod-2)%mod;
                if(xx+n-1>=mod) printf("0\n");
                else
                printf("%lld\n",(sum[xx+n-1]*ni[xx-1]%mod*(pows(d,n))%mod)%mod);

        }

       }

    return 0;
}

