#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
ifstream in("iepuri.in");
ofstream out("iepuri.out");
const int MOD = 666013;
int z[4][4], a[2][4], ans[4][4], aux[4][4];
void init_aux() {
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= 3; j++) {
      aux[i][j] = 0;
    }
  }
}
void init_z() {
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= 3; j++) {
      z[i][j] = 0;
    }
  }
}
void init_ans() {
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= 3; j++) {
      ans[i][j] = 0;
    }
  }
}
int add(int x, int y) {
  x += y;
  if (x >= MOD) {
    x -= MOD;
  }
  return x;
}
int mul(int a, int b) {
  return (1ll * a * b) % MOD;
}
void prod(int x[4][4], int y[4][4]) {
  init_aux();
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= 3; j++) {
      for (int k = 1; k <= 3; k++) {
        aux[i][j] = add(aux[i][j], mul(x[i][k], y[k][j]));
      }
    }
  }
}
void pow(int exp) {
  while(exp) {
    if (exp & 1) {
      prod(ans, z);
      for (int i = 1; i <= 3; i++) {
        for (int j = 1; j <= 3; j++) {
          ans[i][j] = aux[i][j];
        }
      }
    }
    prod(z, z);
    for (int i = 1; i <= 3; i++) {
      for (int j = 1; j <= 3; j++) {
        z[i][j] = aux[i][j];
      }
    }
    exp /= 2;
  }
}
void solve() {
  init_aux();
  init_ans();
  init_z();
  int X, Y, Z, A, B, C, n;
  in >> X >> Y >> Z >> A >> B >> C >> n;
  n++;
  z[1][3] = C;
  z[2][1] = z[3][2] = 1;
  z[2][3] = B;
  z[3][3] = A;
  a[1][1] = X, a[1][2] = Y, a[1][3] = Z;
  ans[1][1] = ans[2][2] = ans[3][3] = 1;
  pow(n - 3);
  init_aux();
  for (int i = 1; i <= 3; i++) {
    for (int k = 1; k <= 3; k++) {
      aux[1][i] = add(aux[1][i], mul(a[1][k], ans[k][i]));
    }
  }
  out << aux[1][3] << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  in >> t;
  while(t--) {
    solve();
  }
  return 0;
}