#include <bits/stdc++.h>

using namespace std;

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

const int Mod = 666013;

struct Mat
{
    long long M[3][3];
    Mat()
    {
        for(int i = 0; i <= 2; i++)
        {
            for(int j = 0; j <= 2; j++)
            {
                M[i][j] = 0;
            }
        }
    }
};

Mat Prod(Mat A, Mat B)
{
    Mat C;
    for(int i = 0; i <= 2; i++)
    {
        for(int j = 0; j <= 2; j++)
        {
            for(int k = 0; k <= 2; k++)
            {
                C.M[i][j] = (C.M[i][j] + A.M[i][k] * B.M[k][j]) % Mod;
            }
        }
    }
    return C;
}

Mat lgput(Mat A, long long exp)
{
    Mat P;
    P.M[0][0] = 1;
    P.M[1][1] = 1;
    P.M[2][2] = 1;
    while(exp)
    {
        if(exp % 2 == 1)
        {
            P = Prod(P, A);
        }
        A = Prod(A, A);
        exp = exp / 2;
    }
    return P;
}

int main()
{
    long long t, x, y, z, a, b, c, n;
    fin>>t;
    while(t)
    {
        fin>>x>>y>>z>>a>>b>>c>>n;
        Mat A;
        A.M[0][1] = 1;
        A.M[1][2] = 1;
        A.M[2][0] = c;
        A.M[2][1] = b;
        A.M[2][2] = a;
        A = lgput(A, n - 2);
        fout<<(((x * A.M[2][0]) % Mod + y * A.M[2][1]) % Mod + z * A.M[2][2]) % Mod<<'\n';
        t--;
    }
    return 0;
}