#include <algorithm>   
#define MOD 666013   
#define ll long long   
#define DIM 5   
using namespace std;   
ll v[DIM][DIM],sol[DIM][DIM];   
int t,x,y,z,a,b,c,n;   
ll rez;   
void mul (ll a[DIM][DIM],ll b[DIM][DIM])   
{   
    ll s[DIM][DIM];   
    int i,j,k;   
    memset (s,0,sizeof (s));   
    for (i=1; i<=3; ++i)   
        for (j=1; j<=3; ++j)   
            for (k=1; k<=3; ++k)   
                s[i][j]=(s[i][j]+a[i][k]*b[k][j])%MOD;   
    memcpy (a,s,sizeof (s));   
}   
int main ()   
{   
    freopen ("iepuri.in","r",stdin);   
    freopen ("iepuri.out","w",stdout);   
    int i;   
    scanf ("%d",&t);   
    for (i=1; i<=t; ++i)   
    {   
        scanf ("%d%d%d%d%d%d%d",&x,&y,&z,&a,&b,&c,&n);   
        memset (v,0,sizeof (v));   
        v[1][2]=v[2][3]=1;   
        v[3][1]=c;   
        v[3][2]=b;   
        v[3][3]=a;   
        memset (sol,0,sizeof (sol));   
        sol[1][1]=sol[2][2]=sol[3][3]=1;   
        for ( ; n; n>>=1)   
        {   
            if (n&1)   
                mul (sol,v);   
            mul (v,v);   
        }   
        rez=((sol[1][1]*x)%MOD+(sol[1][2]*y)%MOD+(sol[1][3]*z)%MOD)%MOD;   
        printf ("%lld\n",rez);   
    }   
    return 0;   
}