#include <bits/stdc++.h>
#define MOD 666013

using namespace std;

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

vector<vector<int>> mat_prod(vector<vector<int>> &a, vector<vector<int>> &b) {
    int n = a.size();
    int m = b[0].size();
    int p = a[0].size();
    vector<vector<int>> c(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < p; k++) {
            for (int j = 0; j < m; j++) {
                c[i][j] += (a[i][k] * b[k][j]) % MOD;
                c[i][j] %= MOD;
            }
        }
    }
    return c;
}

vector<vector<int>> pow_sol(vector<vector<int>> &a, int p) {
    int n = a.size();
    vector<vector<int>> sol(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        sol[i][i] = 1;
    }
    while (p) {
        if (p % 2) {
            sol = mat_prod(sol, a);
        }
        a = mat_prod(a, a);
        p /= 2;
    }
    return sol;
}

int main() {
    int t, x, y, z, a, b, c, n;
    f >> t;
    while (t--) {
        f >> x >> y >> z >> a >> b >> c >> n;
        vector<vector<int>> m(3, vector<int> (3, 0));
        m[0][0] = a;
        m[0][1] = b;
        m[0][2] = c;
        m[1][0] = 1;
        m[2][1] = 1;
        m = pow_sol(m, n - 2);
        int sol = ((m[0][0] * z) % MOD + (m[0][1] * y) % MOD + (m[0][2] * x) %MOD) % MOD;
        g << sol <<'\n';
    }
    return 0;
}