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

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

const int MOD = 666013;

void inmultire(long long sol[3][3], long long mat[3][3])
{
    long long temp[3][3];
    for (int i = 0; i < 3; i++)
    {
        for (int j = 0; j < 3; j++)
        {
            long long rez = 0;
            for (int k = 0; k < 3; k++)
            {
                rez = (rez + sol[i][k] * mat[k][j]) % MOD;
            }
            temp[i][j] = rez;
        }
    }

    for (int i = 0; i < 3; i++)
    {
        for (int j = 0; j < 3; j++)
        {
            sol[i][j] = temp[i][j];
        }
    }
}


int main()
{
    int t, x, y, z, a, b, c, n;
    in >> t;

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

        long long M[3][3]   = { {0, 0, c},
                                {1, 0, b},
                                {0, 1, a} };

        long long I[3][3]   = { {x, y, z},
                                {0, 0, 0},
                                {0, 0, 0} };

        long long ans[3][3] = { {1, 0, 0},
                                {0, 1, 0},
                                {0, 0, 1} };

        int p = n - 2;
        while (p > 0)
        {
            if(p & 1)
            {
                inmultire(ans, M);
            }
            inmultire(M, M);
            p >>= 1;
        }

        inmultire(I, ans);

        out << I[0][2] << "\n";
    }
    return 0;
}