#include <bits/stdc++.h>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const int MOD = 666013;

void Multiply(int A[3][3], int B[3][3])
{
    int p[3][3] = {0}, i, j, k;
    for(i = 0; i < 3; i++)
        for(j = 0; j < 3; j++)
            for(k = 0; k < 3; k++)
                p[i][j] = (p[i][j] + 1LL * A[i][k] * B[k][j]) % MOD;
    for(i = 0; i < 3; i++)
        for(j = 0; j < 3; j++)
            A[i][j] = p[i][j];
}

void Expolog(int A[3][3], int n)
{
    int p[3][3] = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}}, x[3][3], i, j;
    for (i = 0; i < 3; i++)
        for (j = 0; j < 3; j++)
            x[i][j] = A[i][j];

    while (n > 0)
    {
        if (n % 2 == 1) Multiply(p, x);
        n /= 2;
        Multiply(x, x);
    }

    for (i = 0; i < 3; i++)
        for (j = 0; j < 3; j++)
            A[i][j] = p[i][j];
}

int F(int X, int Y, int Z, int A, int B, int C, int N)
{
    if (N == 0) return X;
    if (N == 1) return Y;
    if (N == 2) return Z;
    int T[3][3] = {{A, B, C}, {1, 0, 0}, {0, 1, 0}};
    Expolog(T, N - 2);
    return (1LL * T[0][0] * Z + 1LL * T[0][1] * Y + 1LL * T[0][2] * X) % MOD;
}

int main()
{
    int T, X, Y, Z, A, B, C, n;
    fin >> T;
    while(T--)
    {
        fin >> X >> Y >> Z >> A >> B >> C >> n;
        fout << F(X, Y, Z, A, B, C, n) << "\n";
    }
    return 0;
}