#include <bits/stdc++.h>

using namespace std;
#define MOD 666013
ifstream f("iepuri.in");
ofstream g("iepuri.out");
long long a[3][3],x,y,z,A,B,C,c[3][3],sol[3][3]= {{1,0,0},{0,1,0},{0,0,1}},n,t,i;
void inmultire(long long a[3][3],long long b[3][3])
{
    long long c[3][3],i,j,k;
    memset(c,0,sizeof(c));
    for(i=0; i<=2; i++)
    {
        for (j=0;j<=2;j++)
        {
            for (k=0;k<=2;k++)
            {
                c[i][j]=(c[i][j]+a[i][k]*b[k][j])%MOD;
            }
        }
    }
    for (i=0;i<=2;i++)
    {
        for (j=0;j<=2;j++)
        {
            a[i][j]=c[i][j];
        }
    }
}
void putere(long long sol[3][3],int k)
{
    while(k)
    {
        if(k%2==1)
        {
            inmultire(sol,c);
            k--;
        }
        else
        {
            inmultire(c,c);
            k=k/2;
        }
    }
}
int main()
{
    f>>t;
    for(i=1; i<=t; i++)
    {
        f>>x>>y>>z>>A>>B>>C>>n;
        memset(a,0,sizeof(a));
        memset(c,0,sizeof(c));
        memset(sol,0,sizeof(sol));
        sol[0][0]=sol[1][1]=sol[2][2]=1;
        a[0][0]=x;
        a[0][1]=y;
        a[0][2]=z;
        c[0][2]=C;
        c[1][2]=B;
        c[2][2]=A;
        c[1][0]=c[2][1]=1;
        putere(sol,n);
        inmultire(a,sol);
        g<<a[0][0]<<'\n';
    }
    return 0;
}