#include <fstream>
using namespace std;
ifstream fin ("iepuri.in");
ofstream fout ("iepuri.out");
long long ok,okk,x,y,z,n,aa,bb,cc,p[4][4],ac[4][4],c[4][4],l[4][4];
short int i,j,k,t,q;
void prod (long long a[4][4],long long b[4][4])
{
    if (ok==0&&okk==1)
    {
        for (i=1; i<=3; i++)
        {
            for (j=1; j<=3; j++)
                a[i][j]=b[i][j];
        }
        return ;
    }
    for (i=1; i<=3; i++)
    {
        for (j=1; j<=3; j++)
        {
            c[i][j]=0;
            for (k=1; k<=3; k++)
            {
                c[i][j]+=a[i][k]*b[k][j];
                c[i][j]%=666013;
            }
        }
    }
    for (i=1; i<=3; i++)
    {
        for (j=1; j<=3; j++)
            a[i][j]=c[i][j];
    }
}
int main ()
{
    fin>>t;
    for (q=1; q<=t; q++)
    {
        fin>>x>>y>>z>>aa>>bb>>cc>>n;
        if (n<=2)
        {
            if (n==1)
                fout<<y<<"\n";
            else
                fout<<z<<"\n";
            continue;
        }
        ac[1][1]=0;
        ac[1][2]=1;
        ac[1][3]=0;
        ac[2][1]=0;
        ac[2][2]=0;
        ac[2][3]=1;
        ac[3][1]=cc;
        ac[3][2]=bb;
        ac[3][3]=aa;
        n-=2;
        ok=0;
        okk=0;
        while (n!=0)
        {
            if (n%2==1)
            {
                okk=1;
                prod (p,ac);
                ok=1;
                okk=0;
            }
            prod (ac,ac);
            n=n/2;
        }
        l[1][1]=x;
        l[2][1]=y;
        l[3][1]=z;
        prod (p,l);
        fout<<p[3][1]<<"\n";
    }
    return 0;
}