#include<stdio.h>
#define MOD 666013
long long i,j,N,A,B,C,X,Y,Z,cnt,put,T;
long long sol[4][4],m[4][4];
void mul(long long a[4][4], long long b[4][4])
{
    long long i,j,k,c[4][4]={0};
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            for(k=1;k<=3;k++)
            {
                c[i][j]+=(a[i][k]*b[k][j]);
                c[i][j]%=MOD;
            }
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            a[i][j]=c[i][j];
}

int main(void)
{
    freopen("iepuri.in","r",stdin);
    freopen("iepuri.out","w",stdout);
    scanf("%lld",&T);
    for(cnt=1;cnt<=T;cnt++)
    {
        scanf("%lld%lld%lld%lld%lld%lld%lld",&X,&Y,&Z,&A,&B,&C,&N);
        sol[1][1]=1; sol[1][2]=0; sol[1][3]=0;
        sol[2][1]=0; sol[2][2]=1; sol[2][3]=0;
        sol[3][1]=0; sol[3][2]=0; sol[3][3]=1;
        m[1][1]=0; m[1][2]=0; m[1][3]=C;
        m[2][1]=1; m[2][2]=0; m[2][3]=B;
        m[3][1]=0; m[3][2]=1; m[3][3]=A;
        int put=1<<0;
        i=0;
        N-=2;
        while(put<=N)
        {
            if(put & N)
                mul(sol,m);
            i++;
            put=1<<i;
            mul(m,m);
        }
        printf("%lld\n",(sol[1][3]*X+sol[2][3]*Y+sol[3][3]*Z)%MOD);
    }
    return 0;
}