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

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

int n, A, B, C, a[3][3], b[3][3], p[3][3], x, y, z;

void Prod(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]) % mod;
        }
}

void Copie(int a[3][3], int b[3][3])
{
    int i, j;
    for (i = 0; i < 3; i++)
        for (j = 0; j < 3; j++)
            a[i][j] = b[i][j];
}

void ExpoLog(int a[3][3], int n)
{
    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 (n > 0)
    {
        if (n % 2 == 1)
        {
            Prod(p, a, b);
            Copie(p, b);
        }
        n /= 2;
        Prod(a, a, b);
        Copie(a, b);
    }
}

int main()
{
    int t;
    fin >> t;
    while (t--)
    {
        fin >> x >> y >> z >> A >> B >> C >> n;
        a[1][0] = a[2][1] = 1;
        a[0][0] = a[0][1] = a[1][1] = a[2][0] = 0;
        a[0][2] = C;
        a[1][2] = B;
        a[2][2] = A;
        ExpoLog(a, n - 2);
        fout << (1LL * x * p[0][2] % mod + 1LL * y * p[1][2] % mod +
                                    1LL * z * p[2][2] % mod) % mod << "\n";
    }
    return 0;
}