#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#define ll long long
#define ull unsigned long long
#define ld long double
#define chad char
#define mod 666013
//const int mod=1'000'000'007;
#define dim 100005
#define lim 1000000
#define BASE 31
#define NMAX 21'005
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace __gnu_pbds; 
using namespace std;

ifstream fin("iepuri.in");
ofstream fout("iepuri.out");

int t=1;
ll a,b,c,x,y,z,n;
ll dp[3][3];
ll m[3][3];
ll aux[3][3];
ll i3[3][3];

void mul(ll a[3][3],ll b[3][3],ll c[3][3])
{
    for(int i=0; i<3; i++)
    {
        for(int j=0; j<3; j++)
        {
            c[i][j]=0;
            for(int k=0; k<3; k++)
                c[i][j]=(c[i][j]+(a[i][k]*b[k][j])%mod)%mod;
        }
    }
}

void pw(ll exponent)
{
    while(exponent)
    {
        if(exponent&1)
        {
            mul(i3,m,aux);

            for(int i=0; i<3; i++)
                for(int j=0; j<3; j++)
                    i3[i][j]=aux[i][j];
        }

        exponent/=2;
        mul(m,m,aux);

        for(int i=0; i<3; i++)
            for(int j=0; j<3; j++)
                m[i][j]=aux[i][j];
    }
}

void solve()
{
    fin >> x >> y >> z >> a >> b >> c >> n;

    memset(i3,0,sizeof(i3));
    memset(m,0,sizeof(m));
    memset(dp,0,sizeof(dp));

    dp[0][0]=z;
    dp[1][0]=y;
    dp[2][0]=x;

    for(int i=0; i<3; i++)
        i3[i][i]=1;

    m[0][0]=a;
    m[0][1]=b;
    m[0][2]=c;
    m[1][0]=m[2][1]=1;

    pw(n-2);
    mul(i3,dp,aux);

    fout << aux[0][0] << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr);

    fin >> t;
    while(t--)
        solve();

    return 0;
}