#include <iostream>
#include <fstream>

using namespace std;

typedef unsigned long long uint64;

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

const uint64 N = 3; 
const uint64 MOD = 666013;

void mat_mul(uint64 p[N][N], uint64 a[N][N], uint64 b[N][N]) {
    uint64 aux[N][N];

    for (uint64 i = 0; i < N; i++) {
        for (uint64 j = 0; j < N; j++) {
            aux[i][j] = 0;
            for (uint64 k = 0; k < N; k++) {
                aux[i][j] += ((a[i][k] % MOD) * (b[k][j] % MOD)) % MOD;
                aux[i][j] %= MOD;
            }
            aux[i][j] %= MOD;
        }
    }

    for (uint64 i = 0; i < N; i++) {
        for (uint64 j = 0; j < N; j++) {
            p[i][j] = aux[i][j];
        }
    }
}

int main() {
    int k;
    in >> k;

    uint64 x, y, z, a, b, c, n;
    for (int i = 0; i < k; i++) {
        in >> x >> y >> z >> a >> b >> c >> n;

        uint64 p[N][N] = {{a, b, c}, {1, 0, 0}, {0, 1, 0}};
        uint64 a[N][N] = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}};

        n -= 2;
        while (n != 0) {
            if (n % 2 != 0) {
                mat_mul(a, a, p);
            }

            mat_mul(p, p, p);
            n /= 2;
        }

        out << ((a[0][0] * z % MOD) + (a[0][1] * y % MOD) + (a[0][2] * x % MOD) % MOD) << "\n";
    }

    return 0;
}