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

#define kMod 666013
#define max 1001

int dp[6];

int main()
{
    int T;
    int X,Y,Z,A,B,C;
    unsigned long long N;
    ifstream in("iepuri.in");
    ofstream out("iepuri.out");
    in >> T;

    for(int i = 1; i <= T; ++i) {
        in >> X >> Y >> Z >> A >> B >> C >> N;
        dp[0] = X;
        dp[1] = Y;
        dp[2] = Z;

        for(unsigned long long j = 3; j <= N; j += 3) {
            dp[3] += (A * dp[2] + B*dp[1] + C * dp[0]) % kMod;
            dp[4] += (A * dp[3] + B*dp[2] + C * dp[1]) % kMod;
            dp[5] += (A * dp[4] + B*dp[3] + C * dp[2]) % kMod;
            dp[0] = dp[3];
            dp[1] = dp[4];
            dp[2] = dp[5];
            dp[3] = 0;
            dp[4] = 0;
            dp[5] = 0;
        }
        out << dp[N%3] << '\n';
    }

    in.close();
    out.close();
    return 0;
}