#include <fstream>

using namespace std;

#define ll long long

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

const int max_size = 4, mod = 666013;

long long inm[max_size][max_size], ans[max_size][max_size], aux[max_size][max_size], rez[max_size][max_size];

void prod(long long m1[4][4], ll m2[4][4], ll pr[4][4], int n, int m, int p)
{
    for(int i = 1; i <= m; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            aux[i][j] = 0;
        }
    }
    for(int i = 1; i <= m; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            for(int k = 1; k <= m; k++)
            {
                (aux[i][j] += m1[i][k] * m2[k][j]) %= mod;
            }
        }
    }
    for(int i = 1; i <= m; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            pr[i][j] = aux[i][j];
        }
    }
}

void lgput(ll m[4][4], int n, int e)
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            rez[i][j] = 0;
        }
    }
    for(int i = 1; i <= n; i++)
    {
        rez[i][i] = 1;
    }
    while(e != 0)
    {
        if(e % 2 != 0)
        {
            prod(rez, m, rez, n, n, n);
        }
        prod(m, m, m, n, n, n);
        e /= 2;
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            m[i][j] = rez[i][j];
        }
    }
}

void solve ()
{
    ll x, y, z, a, b, c, n;
    in >> x >> y >> z >> a >> b >> c >> n;
    inm[1][1] = 0;
    inm[2][1] = 1;
    inm[3][1] = 0;
    inm[1][2] = 0;
    inm[2][2] = 0;
    inm[3][2] = 1;
    inm[1][3] = c;
    inm[2][3] = b;
    inm[3][3] = a;
    lgput(inm, 3, n - 2);
    ans[1][1] = x;
    ans[1][2] = y;
    ans[1][3] = z;
    prod(ans, inm, ans, 1, 3, 3);
    out << ans[1][3] << '\n';
}

int main ()
{
    int t;
    in >> t;
    while (t--)
    {
        solve();
    }
    in.close();
    out.close();
    return 0;
}