#include <bits/stdc++.h>

using i64 = long long;


const int MOD = 666013;

int mul(const int &a, const int &b) {
    return 1LL * a * b % MOD;
}

int add(int a, const int &b) {
    a += b;
    if (a >= MOD) {
        a -= MOD;
    }
    return a;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    freopen("iepuri.in", "r", stdin);
    freopen("iepuri.out", "w", stdout);

    int tt = 1;
    std::cin >> tt;
    while (tt--) {
        int x, y, z, a, b, c, n;
        std::cin >> x >> y >> z >> a >> b >> c >> n;
        std::vector<int> dp(n + 1);
        dp[0] = x;
        dp[1] = y;
        dp[2] = z;
        for (int i = 3; i <= n; ++i) {
            dp[i] = add(add(mul(a, dp[i - 1]), mul(b, dp[i - 2])), mul(c, dp[i - 3]));
        }
        std::cout << dp[n] << "\n";
    }
    return 0;
}