// oeis.org
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void debug3(bool *t,int st,int n) {cerr << '{' << t[st];for(int i=st+1;i<=n;i++) cerr<<",",__print(t[i]);cerr <<"}"<<'\n';}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define debug2(x...) cerr<<"[" << #x << "] = "; debug3(x)
#endif
 
/// = any_of(a.begin(), a.end(), [](int x) { return x == 9; }); macar un element e 9
/// = all_of(a.begin(), a.end(), [](int x) { return x == 9; }); toate sunt 9
/// = none_of(a.begin(), a.end(), [](int x) { return x == 9; }); n am nici un 9
/// = count(a.begin(), a.end(), x); cate sunt x
 
#define N 1005
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sf second.first
#define ss second.second
#define INF 1e18

const int MOD = 666013;

int m[5][10][10],k=3;

void factmat(int x)
{
    int i,j,p;
    for ( i = 1 ; i <= k ; i++ )
    {
        for ( j = 1 ; j <= k ; j++ )
        {
            m[2][i][j] = 0 ;
            for ( p = 1 ; p <= k ; p++ )
            {
                m[2][i][j] = (m[2][i][j] + 1LL*m[x][i][p]*m[1][p][j])%MOD;
            }
        }
    }
    for ( i = 1 ; i <= k ; i++ )
        for ( j = 1 ; j <= k ; j++ )
            m[x][i][j] = m[2][i][j];
}

void lgput(int b)
{
    while ( b > 0 )
    {
        if ( b&1 )
            factmat(0);
        factmat(1);
        b = b>>1 ;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("test.in", "r", stdin);
    ifstream fin("iepuri.in");
    ofstream fout("iepuri.out");
    int x,y,z,a,b,c,n,t,i,j,p;
    fin >> t ;
    while ( t-- )
    {
        fin >> x >> y >> z >> a >> b >> c >> n ;
        memset(m,0,sizeof(m));
        m[1][1][3] = c ;
        m[1][2][1] = 1 ;
        m[1][2][3] = b ;
        m[1][3][2] = 1 ;
        m[1][3][3] = a ;
        m[0][1][1] = 1 ;
        m[0][2][2] = 1 ;
        m[0][3][3] = 1 ;
        lgput(n-2);
        m[3][1][1] = x ;
        m[3][1][2] = y ;
        m[3][1][3] = z ;
        for ( i = 1 ; i <= k ; i++ )
        {
            for ( j = 1 ; j <= k ; j++ )
            {
                m[2][i][j] = 0 ;
                for ( p = 1 ; p <= k ; p++ )
                {
                    m[2][i][j] = (m[2][i][j] + 1LL*m[3][i][p]*m[0][p][j])%MOD;
                }
            }
        }
        fout << m[2][1][3] << '\n';

    }
}