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

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

int a[3][3], p[3][3], b[3][3], n;
int X, Y, Z, A, B, C;

void inmultire(int a[3][3], int b[3][3], int c[3][3])
{
    int i, j, k;
    for (i = 0; i < 3; i++)
        for (j = 0; j < 3; j++)
    {
        c[i][j] = 0;
        for (k = 0; k < 3; k++)
            c[i][j] = (c[i][j] + 1LL * a[i][k] * b[k][j]) % 666013;
    }
}

void lgput(int n)
{
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            p[i][j] = 0;
    p[0][0] = p[1][1] = p[2][2] = 1;

    while (n > 0)
    {
        if (n % 2 == 1)
        {
            inmultire(p, a, b);
            for (int i = 0; i < 3; i++)
                for (int j = 0; j < 3; j++)
                    p[i][j] = b[i][j];
        }
        n /= 2;
        inmultire(a, a, b);
        for (int i = 0; i < 3; i++)
            for (int j = 0; j < 3; j++)
                a[i][j] = b[i][j];
    }
}

int main()
{
    int T, sol;
    fin >> T;
    while (T--)
    {
        fin >> X >> Y >> Z >> A >> B >> C >> n;
        a[0][0] = 0; a[0][1] = 0; a[1][1] = 0; a[2][0] = 0;
        a[1][0] = 1; 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";
    }
    fout.close();
    return 0;
}