#pragma region
#include <bits/stdc++.h>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef HOME
    ~debug() { cerr << endl; }
    eni(!= ) cerr << boolalpha << i; ris;
}
eni(== ) ris << range(begin(i), end(i));
}
sim, class b dor(pair < b, c > d) {
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

const long long modIep = 666013;
#pragma endregion

void initMat(vector<vector<long long>>& mat, vector<long long> bottomRow) {
    size_t sizeMat = mat.size() - 1, sizeRow = bottomRow.size() - 1;
    for (size_t i = 0; i <= sizeMat; ++i) {
        mat[sizeMat][i] = bottomRow[sizeRow - i];
    }
    for (size_t i = 0; i < sizeMat; ++i) {
        mat[i][i + 1] = 1;
    }
}

vector<vector<long long>> multiply(vector<vector<long long>> a, vector<vector<long long>> b) {
    size_t N = a.size(), M = b.size(), K = b[0].size();
    assert(a[0].size() == (size_t) M); // NxM by MxK

    vector<vector<long long>> ret;
    for (size_t i = 0; i < N; ++i)
        ret.push_back(vector<long long>(K));

    for (size_t i = 0; i < N; ++i)
        for (size_t j = 0; j < K; ++j)
            for (size_t k = 0; k < M; ++k)
                ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % modIep;
    return ret;
}


vector<vector<long long>> binpow(vector<vector<long long>> numMat, long long pow)
{
    int N = numMat.size();
    assert((size_t) N == numMat[0].size()); // NxN
    vector<vector<long long>> ans;
    for (int i = 0; i < N; i++)
        ans.push_back(vector<long long>(N));

    for (int i = 0; i < N; i++)
        ans[i][i] = 1;
    for (long long bit = 0; bit < 64; ++bit) {
        if ((pow >> bit) & 1)
            ans = multiply(ans, numMat);
        numMat = multiply(numMat, numMat);
    }
    return ans;
}

void solve() {

    vector<vector<long long>> func(3, vector<long long>(1));   // f(n) | n=1,2,3
    vector<long long> expo(3);  // expo growth
    long long n;                // day
    fin >> func[0][0] >> func[1][0] >> func[2][0] >> expo[0] >> expo[1] >> expo[2] >> n;
    long long dimMat = n - 2;
    vector<vector<long long>> matrix(3, vector<long long>(3));
    initMat(matrix, expo);
    vector<vector<long long>> ans = binpow(matrix, dimMat);
    ans = multiply(ans, func);

    fout << ans[2][0] << '\n';
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;  fin >> t;
    while (t--) {
        solve();
    }

    return 0;
}