#include <fstream>
#include <iostream>
#include <vector>

constexpr int MOD = 666013;

std::vector<std::vector<long long>> multiply(const std::vector<std::vector<long long>> &a,
                                             const std::vector<std::vector<long long>> &b) {
    std::vector<std::vector<long long>> result(3, std::vector<long long>(3, 0));
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
            for (int k = 0; k < 3; ++k) {
                result[i][j] = (result[i][j] + (a[i][k] * b[k][j]) % MOD) % MOD;
            }
        }
    }
    return result;
}

std::vector<std::vector<long long>> matrixPower(std::vector<std::vector<long long>> base, long long exp) {
    std::vector<std::vector<long long>> result = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}};
    while (exp > 0) {
        if (exp % 2 == 1) {
            result = multiply(result, base);
        }
        base = multiply(base, base);
        exp /= 2;
    }
    return result;
}

long long solve(long long x, long long y, long long z, long long a, long long b, long long c, long long n) {
    if (n == 0)
        return x;
    if (n == 1)
        return y;
    if (n == 2)
        return z;

    std::vector<std::vector<long long>> transition = {{a, b, c}, {1, 0, 0}, {0, 1, 0}};
    std::vector<std::vector<long long>> result = matrixPower(transition, n - 2);

    long long ans = (((result[0][0] * z) % MOD + (result[0][1] * y) % MOD) % MOD + (result[0][2] * x) % MOD) % MOD;
    return ans;
}

int main() {
    std::ifstream fin("iepuri.in");
    std::ofstream fout("iepuri.out");

    int t;
    fin >> t;

    for (int i = 0; i < t; ++i) {
        long long x, y, z, a, b, c, n;
        fin >> x >> y >> z >> a >> b >> c >> n;
        fout << solve(x, y, z, a, b, c, n) << '\n';
    }

    return 0;
}