#include <fstream>
#include <vector>

using namespace std;

const int MOD = 666013;
const int N = 3;

void produs(vector <vector <int>> &a, vector <vector <int>> &b)
{
    vector <vector <int>> p(N);
    for (int i = 0; i < N; i++)
    {
        p[i].resize(N, 0);
        for (int j = 0; j < N; j++)
        {
            for (int k = 0; k < N; k++)
            {
                p[i][k] += (long long)a[i][j] * b[j][k] % MOD;
                if (p[i][k] >= MOD)
                {
                    p[i][k] -= MOD;
                }
            }
        }
    }
    a = p;
}

void putere(vector <vector <int>> &a, int n)
{
    vector <vector <int>> p(N);
    p[0] = {1, 0, 0};
    p[1] = {0, 1, 0};
    p[2] = {0, 0, 1};
    while (n != 0)
    {
        if (n % 2 != 0)
        {
            produs(p, a);///p *= a
        }
        produs(a, a);///a *= a
        n /= 2;
    }
    a = p;
}

int main()
{
    ifstream in("iepuri.in");
    ofstream out("iepuri.out");
    int t;
    in >> t;
    vector <vector <int>> mat(N);
    mat[0].resize(N);
    mat[1].resize(N);
    mat[2].resize(N);
    for (int i = 0; i < t; i++)
    {
        int x, y, z, n;
        in >> x >> y >> z >> mat[0][0] >> mat[0][1] >> mat[0][2] >> n;
        mat[1] = {1, 0, 0};
        mat[2] = {0, 1, 0};
        putere(mat, n - 2);
        out << ((long long)mat[0][0] * z + (long long)mat[0][1] * y + (long long)mat[0][2] * x) % MOD << "\n";
    }
    in.close();
    out.close();
    return 0;
}