#include <bits/stdc++.h>
#define MOD 666013
#define ll long long
using namespace std;

ifstream fin("iepuri.in");
ofstream fout("iepuri.out");

long long int t, x, y, z, a, b, c, n;

void I(ll a[3][3], ll b[3][3])
{
    ll c[3][3];


    for(int i = 0; i <= 2; i++)
        for(int j = 0; j <= 2; j++)
         {
             c[i][j] = 0;
            for(int k = 0; k <= 2; k++)
                c[i][j] = (c[i][j]+a[i][k]*b[k][j])%MOD;
         }
    for(int i = 0; i <= 2; i++)
        for(int j = 0; j <= 2; j++)
            a[i][j] = c[i][j];

}

int main()
{
    fin >> t;

    while(t--)
    {
        fin >> x >> y >> z >> a >> b >> c >> n;

        if(n == 0)
        {
            fout << x << '\n';
            continue;
        }
        if(n == 1)
        {
            fout << y << '\n';
            continue;
        }
        if(n == 2)
        {
            fout << z << '\n';
            continue;
        }

        ll m[3][3], p[3][3], q[3][3];
        for(int i = 0; i <= 2; i++)
            for(int j = 0; j <= 2; j++)
                p[i][j] = q[i][j] = 0;
        m[0][0] = m[0][1] = 0;
        m[0][2] = c;
        m[1][0] = 1;
        m[1][1] = 0;
        m[1][2] = b;
        m[2][0] = 0;
        m[2][1] = 1;
        m[2][2] = a;
        p[0][0] = p[1][1] = p[2][2] = 1;
        q[0][0] = q[1][1] = q[2][2] = 1;

        for(ll i = 0; (1<<i) <= n; i++)
        {
            I(p, m);

            if((1<<i)&(n-2))
                I(q, p);

        }

        fout << ((x*q[0][2])%MOD+(y*q[1][2])%MOD+(z*q[2][2])%MOD)%MOD<< '\n';


    }



    return 0;
}