#include <iostream>
#include <cstring>
#include <fstream>

#define MOD 666013
#define KMAX 3

void multiply_matrix(int A[KMAX][KMAX], int B[KMAX][KMAX], int C[KMAX][KMAX]) {
    int tmp[KMAX][KMAX]; //see the power function
    for (int i = 0; i < KMAX; ++i) {
        for (int j = 0; j < KMAX; ++j) {
            unsigned long long int sum = 0;
            for (int k = 0; k < KMAX; ++k) {
                sum += 1LL * A[i][k] * B[k][j];
            }
            tmp[i][j] = sum % MOD;
        }
    }
    memcpy(C, tmp, sizeof(tmp));
}

// R = C ^ n
void power_matrix(int C[KMAX][KMAX], int n, int R[KMAX][KMAX]) {
    int tmp[KMAX][KMAX];
    //tmp = I kmax
    for (int i = 0; i < KMAX; ++i) {
        for (int j = 0; j < KMAX; ++j) {
            if (i == j) {
                tmp[i][j] = 1;
            } else {
                tmp[i][j] = 0;
            }
        }
    }

    while (n != 1) {
        if (n % 2 == 0) {
            multiply_matrix(C, C, C);
            n /= 2;
        } else {
            multiply_matrix(tmp, C, tmp);
            --n;
        }
    }

    multiply_matrix(C, tmp, R);
}

int main() {

    std::ifstream f("iepuri.in");
    std::ofstream g("iepuri.out");
    int t, x, y, z, a, b, c, n;
    f >> t;
    for (int i = 1; i <= t; ++i) {
        f >> x >> y >> z >> a >> b >> c >> n;
        int C[KMAX][KMAX] = {{0, 0, 0},
                             {1, 0, 0},
                             {0, 1, 0}};
        C[0][2] = c;
        C[1][2] = b;
        C[2][2] = a;
        power_matrix(C, n - 2, C);
        g << (1LL * x * C[0][2] %MOD + 1LL* y * C[1][2] % MOD + 1LL * z * C[2][2] % MOD) % MOD << '\n';
    }
    return 0;
}