#include <bits/stdc++.h>
#define MOD 666013

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, n;
void Prod(int x[3][3], int y[3][3])
{
    int i, j, k, nr;
    for(i = 0;i < 3;i++)
        for(j = 0;j < 3;j++)
        {
            nr = 0;
            for(k = 0;k < 3;k++)
                nr = (nr + 1LL * x[i][k] * y[k][j] % MOD) % MOD;
            b[i][j] = nr;
        }
}
void Copie_p()
{
    int i, j;
    for(i = 0;i < 3;i++)
        for(j = 0;j < 3;j++)
            p[i][j] = b[i][j];
}
void Copie_a()
{
    int i, j;
    for(i = 0;i < 3;i++)
        for(j = 0;j < 3;j++)
            a[i][j] = b[i][j];
}
void ExpoLog(int m)
{
    p[0][0] = p[1][1] = p[2][2] = 1;
    p[0][1] = p[0][2] = p[1][0] = p[1][2] = p[2][0] = p[2][1] = 0;
    while(m > 0)
    {
        if(m % 2 == 1)
        {
            Prod(p, a);
            Copie_p();
        }
        m /= 2;
        Prod(a, a);
        Copie_a();
    }
}

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;
        ExpoLog(n - 2);
        fout << (1LL * x * p[0][2] % MOD + 1LL * y * p[1][2] % MOD + 1LL * z * p[2][2] % MOD) % MOD << "\n";
        t--;
    }
    fout.close();
    return 0;
}