#include <fstream>
#include <iostream>
#include <vector>
#include <string.h>

#define KMAX 3
#define MOD 666013

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

    memcpy(C, tmp, sizeof(tmp));
}
 
void power_matrix(int C[KMAX][KMAX], int p, int R[KMAX][KMAX]) {
    int tmp[KMAX][KMAX];
    for (int i = 0; i < KMAX; ++i) {
        for (int j = 0; j < KMAX; ++j) {
            tmp[i][j] = (i == j) ? 1 : 0;
        }
    }
 
    while (p != 1) {
        if  (p % 2 == 0) {
            multiply_matrix(C, C, C);
            p /= 2;
        } else {
            multiply_matrix(tmp, C, tmp);
            --p;                          
        }
    }
 
    multiply_matrix(C, tmp, R);
}
int main () {

    int x, y, z, a, b, c, T;
    long n;
    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;
        
        int C[3][3] ={0};
        C[1][0] = 1;
        C[2][1] = 1;
    
        C[0][2] = c;
        C[1][2] = b;
        C[2][2] = a;

        power_matrix(C, n - 2, C);

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

    return 0;

}