#include <iostream>
#include <fstream>
#define MOD 666013

using namespace std;

ifstream f("iepuri.in");
ofstream g("iepuri.out");

int x,y,z,A,B,C,n,t;
long long a[3][3],b[3][3],c[3][3],m[3][3],s[3];

void inmultire(long long a[3][3], long long b[3][3], long long c[3][3])
{
    for(int i=0; i<3; i++)
        for(int j=0; j<3; j++)
            c[i][j] = 0;
    for(int i=0; i<3; i++)
    {
        for(int j=0; j<3; j++)
        {
            long long fin=0;
            for(int k=0; k<3; k++)
                fin = (fin + (a[i][k]*b[k][j])%MOD)%MOD;
            c[i][j] = fin;
        }
    }
}

void inloc(long long a[3][3], long long b[3][3])
{
    for(int i=0; i<3; i++)
        for(int j=0; j<3; j++)
            a[i][j] = b[i][j];
}


void mn()
{
    b[0][0] = 1;
    b[0][1] = 0;
    b[0][2] = 0;
    b[1][0] = 0;
    b[1][0] = 0;
    b[1][1] = 1;
    b[1][2] = 0;
    b[2][0] = 0;
    b[2][1] = 0;
    b[2][2] = 1;
    int p = n-2;
    while(p > 0)
    {
        if(p%2 == 1)
        {
            p--;
            inmultire(b, m, c);
            inloc(b, c);
            continue;
        }
        inmultire(m, m, c);
        inloc(m, c);
        p/=2;
    }
}

int main()
{
    f>>t;
    for(int i=0;i<t;i++)
    {
        f>>x>>y>>z;
        f>>A>>B>>C;
        f>>n;
        m[0][0] = A;
        m[0][1] = 1;
        m[0][2] = 0;
        m[1][0] = B;
        m[1][1] = 0;
        m[1][2] = 1;
        m[2][0] = C;
        m[2][1] = 0;
        m[2][2] = 0;
        s[0] = z;
        s[1] = y;
        s[2] = x;
        mn();
        long long sum=0;
        for(int i=0; i<3; i++)
           sum = (sum + (s[i]*c[i][0])%MOD)%MOD;
        g<<sum<<'\n';
    }
    return 0;
}