#include <fstream>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <climits>
#include <cstring>
using namespace std;
#define ll long long
#define KMAX 3

const int mod = 666013;
int x, y, z, a, b, c, i = 0, t, k;
ll n;

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

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];
            }

            tmp[i][j] = sum % mod;
        }
    }

    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);
}

void rez(int x, int y, int z, int a, int b, int c, ll n) {
  if(n == 3) g << (a * z % mod + b * y % mod + c * x % mod) % mod << endl;

  int C[KMAX][KMAX] = { {0, 0, c},
                        {1, 0, b},
                        {0, 1, a}};

  power_matrix(C, n - 2, C);
  ll sol = (1LL * z * C[2][2] % mod + (1LL * y * C[1][2] % mod + 1LL * x * C[0][2]) % mod ) % mod;

  g << sol % mod << endl;
}

int main() {

  f >> t;
  for(k = 0; k < t; k++) {
    f >> x >> y >> z >> a >> b >> c >> n;
    rez(x, y, z, a, b, c, n);
  }
  return 0;
}