#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

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

const int MOD = 666013;

typedef vector<vector<int>> Matrix;

Matrix log_pow(Matrix base, int exponent);
Matrix matrix_multiply(const Matrix &a, const Matrix &b);
int mod(long long x, int mod);

int main() {
  int t;
  fin >> t;

  int x, y, z, a, b, c, n;
  Matrix M, result;
  for (int i = 1; i <= t; ++i) {
    fin >> x >> y >> z >> a >> b >> c >> n;
    M = {{0, 1, 0},
         {0, 0, 1},
         {c, b, a}};

    M = log_pow(M, n - 3);
    result = {{x}, {y}, {z}};

    result = matrix_multiply(M, result);
    fout << mod(result[2][0], MOD);
  }

  return 0;
}

Matrix log_pow(Matrix base, int exponent) {
  Matrix result = base;
  for (int p = 1; p <= exponent; p <<= 1) {
    if (p & exponent)
      result = matrix_multiply(result, base);
    base = matrix_multiply(base, base);
  }
  return result;
}

Matrix matrix_multiply(const Matrix &a, const Matrix &b) {
  int n = a.size();
  int m = b.size();
  int p = b[0].size();

  Matrix result(n, vector<int>(p));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < p; ++j) {
      for (int k = 0; k < m; ++k) {
        result[i][j] += mod((1LL * a[i][k] * b[k][j]), MOD);
      }
    }
  }
  return result;
}

inline int mod(long long x, int m) {
  if (x < m) return x;
  if (x < 2 * m) return x - m;
  return x % m;
}