#include <fstream>
#include <string>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <string.h>
#include <queue>

#define INF 0x3f3f3f3f
#define MOD 666013

using namespace std;

#ifdef DEBUG
string name = "data";
#else
string name = "iepuri";
#endif

ifstream fin(name + ".in");
ofstream fout(name + ".out");

struct Matrix {
    int x[3][3];
};

Matrix mult(Matrix x, Matrix y) {
    Matrix r;
    memset(r.x,0,sizeof(r));
    
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
            for (int k = 0; k < 3; ++k) {
                r.x[i][j] += x.x[i][k] * y.x[k][j];
                r.x[i][j] %= MOD;
            }
        }
    }
    
    return r;
}

Matrix pow(Matrix x, int p) {
    if (p == 0) {
        Matrix r;
        r.x[0][0] = 1;
        r.x[1][1] = 1;
        r.x[2][2] = 1;
        return r;
    }
    if (p == 1) {
        return x;
    }
    Matrix y = pow(x, p / 2);
    
    if (p % 2 == 0) {
        return mult(y, y);
    }
    
    return mult(mult(y, y),x);
}

void solve() {
    
    int X,Y,Z,A,B,C,N;
    
    fin >> X >> Y >> Z >> A >> B >> C >> N;
    
    if (N == 0) {
        fout << X;
        return;
    }
    
    if (N == 1) {
        fout << Y;
        return;
    }
    
    if (N == 2) {
        fout << Z;
        return;
    }
    
    Matrix m;
    
    memset(m.x, 0, sizeof(m.x));

    m.x[0][0] = A;
    m.x[0][1] = B;
    m.x[0][2] = C;
    m.x[1][0] = 1;
    m.x[2][1] = 1;
    
    Matrix r = pow(m, N - 2);
    
    fout << (r.x[0][0] * Z + r.x[0][1] * Y + r.x[0][2] * X) % MOD << "\n";
}

int t;

int main() {
    
    fin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}