#include<cstdio>
using namespace std;
#define mod 666013
long long a[3][3],b[3][3],n,q;
long long c[3][3];

void matmult(long long a[3][3],long long b[3][3])
{


int i,j,k;
for(i=0;i<=3;++i)
		for (j=0;j<=3;++j)
			c[i][j]=0;
		
for(i=0;i<3;i++)
	for(j=0;j<3;j++)
		for(k=0;k<3;k++)
			c[i][j]=(c[i][j]+b[i][k]*a[k][j])%mod;
	
		for(i=0;i<3;i++)
			for(j=0;j<3;j++)
				a[i][j]=c[i][j];
}


void read()
{
	
	long long t,x,y,z,d,e,f;
	int i,j,k,l;
	scanf("%lld",&t);
	
	for(i=1;i<=t;i++)
{
	for(j=0;j<=3;++j)
		for (k=0;k<=3;++k)
			a[j][k]=b[j][k]=0;
		
	scanf("%lld %lld %lld %lld %lld %lld %lld",&x,&y,&z,&d,&e,&f,&n);
	
	a[2][0]=x; a[1][0]=y; a[0][0]=z;
	b[0][0]=d; b[0][1]=e; b[0][2]=f; 

	 b[1][0]=1;b[2][1]=1;
	
	n=n-2;
	q=n;
	while (q)
	{
		if(q&1)
		{
			matmult(a,b);
		}
		matmult(b,b);
		q=q>>1;
	}
	printf("%lld\n",a[0][0]);
}

}


int main()
{
	
freopen("iepuri.in","r",stdin);
freopen("iepuri.out","w",stdout);
read();
}