#include <cstdio>
#include <cstring>
const int MOD = 666013;
int n, i;
int v[3][3], rez[3][3];

inline void mult(int a[][3], int b[][3], int c[][3]) {
	int i, j, k;
	for (i = 0; i <= 2; i++)
		for (j = 0; j <= 2; j++)
			for (k = 0; k <= 2; k++)
				c[i][j] = (c[i][j] + 1LL * a[i][k] * b[k][j]) % MOD;

}

inline void lgput(int power, int m[][3]) {
	int cpy[3][3], aux[3][3], i;
	memcpy(cpy, v, sizeof(v));
	m[0][0] = m[1][1] = m[2][2] = 1;

	for (i = 0; 1ll * (1 << i) <= power; i++) {
		if (power & (1 << i)) {
			memset(aux, 0, sizeof(aux));
			mult(m, cpy, aux);
			memcpy(m, aux, sizeof(aux));
		}
		memset(aux, 0, sizeof(aux));
		mult(cpy, cpy, aux);
		memcpy(cpy, aux, sizeof(cpy));
	}
}
int help[3][3];
int main() {
  int x , y , z , tests,  a , b , c;
	freopen("iepuri.in", "r", stdin);
	freopen("iepuri.out", "w", stdout);
	scanf("%d" , &tests);
	while(tests){
      for(int i = 0 ; i <= 2 ; i ++)
    for(int j = 0 ; j <= 2 ; j ++)
      help[i][j] = v[i][j] = 0;
	scanf("%d%d%d%d%d%d%d", &x , &y , &z , &a , &b , &c , &n);
	v[1][0] = 1;
	v[2][1] = 1;
	v[0][2] = c;
	v[1][2] = b;
  v[2][2] = a;

	lgput(n - 2, help);
	printf("%lld\n", (1ll *help[0][2] * x + 1ll * help[1][2] * y + 1ll * help[2][2] * z) % MOD);
	tests --;
	}
	return 0;
}