#include <stdio.h>
#define mod 666013

using namespace std;

struct matrice {long long int m[3][3];};

matrice inmultire_matrice(matrice a, matrice b) {
    matrice c;
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            c.m[i][j] = 0;
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            for (int k = 0; k < 3; k++)
                c.m[i][j] = (c.m[i][j] + a.m[i][k] * b.m[k][j]) % mod;
    return c;
}

void lgput(matrice &a, long long int x) {
    matrice sol, exp = a;
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            sol.m[i][j] = 0;
    sol.m[0][0] = sol.m[1][1] = sol.m[2][2] = 1;
    while (x) {
        if (x & 1)
            sol = inmultire_matrice(sol, exp);
        exp = inmultire_matrice(exp, exp);
        x >>= 1;
    }
    a = sol;
}

int main()
{
    int t, x, y, z, a, b, c, n;
    freopen("iepuri.in", "r", stdin);
    freopen("iepuri.out", "w", stdout);
    scanf("%d", &t);
    for (int i = 0; i < t; i++) {
        scanf("%d %d %d %d %d %d %d", &x, &y, &z, &a, &b, &c, &n);
        matrice recurenta;
        for (int j = 0; j < 3; j++)
            for (int k = 0; k < 3; k++)
                recurenta.m[j][k] = 0;
        recurenta.m[0][0] = a;
        recurenta.m[0][1] = b;
        recurenta.m[0][2] = c;
        recurenta.m[1][0] = 1;
        recurenta.m[2][1] = 1;
        lgput(recurenta, n - 2);
        printf("%d\n", recurenta.m[0][0] * z % mod + recurenta.m[0][1] * y % mod + recurenta.m[0][2] * x % mod);
    }
    return 0;
}