#include <fstream>
#include <iostream>
#include <vector>

#define N 3
#define MOD 666013

int mod_sum(int a, int b) {
    a %= MOD;
    b %= MOD;
    unsigned long long res = a;
    res += b;
    return res % MOD;
}

std::vector < std::vector <int> > multiply_matrix (std::vector < std::vector <int> > A,
std::vector < std::vector <int> > B) {
    std::vector < std::vector <int> > tmp;
    tmp.resize(A.size());
    for (unsigned i = 0; i < A.size(); i++) {
        tmp[i].resize(B[0].size());
    }

    for (unsigned i = 0; i < A.size(); i++) {
        for (unsigned j = 0; j < B[0].size(); j++) {
            int sum = 0;
            for (unsigned k = 0; k < A[0].size(); k++) {
                sum = sum + A[i][k] * B[k][j];
            }
            tmp [i][j] = 1LL * sum;
        }
    }

    return tmp;
}

std::vector < std::vector <int> > power_matrix (std::vector < std::vector <int> > A, int p) {
    std::vector < std::vector <int > > I; 
    I.resize(A.size());
    for (unsigned i = 0; i < A.size(); i++) {
        I[i].resize(A[0].size());
    }
    
    for (unsigned i = 0; i < A.size(); i++) {
        for (unsigned j = 0; j < A[0]. size(); j++) {
            I[i][j] = (i == j) ? 1 : 0;
        }
    }

    while (p != 1) {
        if (p % 2 == 0) {
            A = multiply_matrix(A, A);
            p /= 2;
        } else {
            I = A;
            p--;
        }
    }

    return multiply_matrix(A, I);
}

int main () {

    int x, y, z, a, b, c, n, T;
    freopen("iepuri.in", "r", stdin);
    freopen("iepuri.out", "w", stdout);
    
    std::cin >> T;
    for (int i = 1; i <= T; i++) {
        std::cin >> x >> y >> z >> a >> b >> c >> n;
        std::vector <std::vector <int> > C(3, std::vector <int> (3, 0));
        C[1][0] = 1;
        C[2][1] = 1;
        C[0][2] = c;
        C[1][2] = b;
        C[2][2] = a;

        C = power_matrix(C, n - 2);

        int result = (x * C[0][2] + y * C[1][2] + z * C[2][2]) % MOD ;
        std::cout << result << "\n";
    }

    return 0;

}