#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;

int solve(int x, int y, int z, int a, int b, int c, int n);
Matrix log_pow(Matrix base, int exponent, int mod = 1);
Matrix matrix_multiply(Matrix a, Matrix b, int mod = 1);
void print_matrix(Matrix m);

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

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

		fout << solve(x, y, z, a, b, c, n) << '\n';
	}

	return 0;
}

int solve(int x, int y, int z, int a, int b, int c, int n) {
	Matrix M = {{0, 1, 0},
							{0, 0, 1},
							{c, b, a}};
	
	print_matrix(M);
	M = log_pow(M, n - 3, MOD);
	print_matrix(M);
	Matrix result = {{x}, {y}, {z}};

	print_matrix(result);
	result = matrix_multiply(M, result, MOD);
	print_matrix(result);
	return result[2][0];
}

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

Matrix matrix_multiply(Matrix a, Matrix b, int mod) {
	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] += a[i][k] * b[k][j];
				result[i][j] %= mod;
			}
		}
	}
	return result;
}

void print_matrix(Matrix M) {
	int n = M.size();
	int m = M[0].size();

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			cerr << M[i][j] << ' ';
		}
		cerr << endl;
	}

	cerr << endl;
}