#include <bits/stdc++.h>

using namespace std;

ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int a[3][3], b[3][3], p[3][3],x,y,z,A,B,C,sol,n;
void Copie(int a[3][3], int b[3][3])
{
    int i, j;
    for (i = 0; i <= 2; i++)
        for (j = 0; j <= 2; j++)
            a[i][j] = b[i][j];
}
void Produs(int a[3][3], int b[3][3], int c[3][3])
{
    int i, j, k;
    for (i=0; i<=2; i++)
        for (j = 0; j <= 2; j++)
        {
            c[i][j] = 0;
            for (k = 0; k <= 2; k++)
                c[i][j] = (c[i][j] + 1ll * a[i][k] * b[k][j]) % 666013;
        }
}
void LgPut(int n)
{
    for (int i = 0; i <= 2; i++)
        for (int j = 0; j <= 2; j++)
            p[i][j] = 0;
    p[1][1] = p[0][0] = p[2][2] = 1;
    while (n)
    {
        if (n % 2 == 1)
        {
            Produs(p, a, b);
            Copie(p, b);
        }
        n /= 2;
        Produs(a, a, b);
        Copie(a, b);
    }
}
int main()
{
    int t;
    fin >> t;
    while (t--)
    {
        fin >> x >> y >> z >> A >> B >> C >> n;
        a[0][0] = a[0][1] = a[1][1] = a[2][0] = 0;
        a[1][0] = a[2][1] = 1;
        a[0][2] = C; a[1][2] = B; a[2][2] = A;
        LgPut(n - 2);
        sol = (1ll * x * p[0][2] + 1ll * y * p[1][2] + 1ll * z * p[2][2]) % 666013;
        fout << sol << "\n";
    }
    return 0;
}