#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <iostream>
#define mod 666013
using namespace std;

int **multiplication(int **a,int **b,int n){
	int **result = (int**)malloc(n*sizeof(int*));
	for(int i=0;i<n;i++)
		result[i] = (int*)malloc(n*sizeof(int));
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			result[i][j]=0;
			for(int k=0;k<n;k++)
			result[i][j] +=(a[i][k]*b[k][j]);			
		}
	}
	return result;
}

int **fast_multiplication(int **matrix,int exponent,int n){
	if(exponent == 1) return matrix;
	int **res = fast_multiplication(matrix,exponent/2,n);
	if(exponent%2 == 1) return  
		multiplication(matrix,multiplication(res,res,n),n);
	else
		return multiplication(res,res,n);
}

int iepuri(int x,int y,int z,int a,int b,int c,int n){
	if(n==1) return y;
	if(n==2) return z;
	int **result = (int**)calloc(n,sizeof(int*));
	for(int i=0;i<3;i++)
		result[i] = (int*)calloc(n,sizeof(int));
	result[0][1] = 1;
	result[1][2] = 1;
	result[2][0] = c;
	result[2][1] = b;
	result[2][2] = a;
	int **matrix = fast_multiplication(result,n-2,3);
	return (matrix[2][0]*x+matrix[2][1]*y+matrix[2][2]*z);	 
}


int main(){
	ifstream in("iepuri.in");
	ofstream out("iepuri.out");
	int nr_linii;
	in>>nr_linii;
	int x,y,z,a,b,c,n;
	for(int i=0;i<nr_linii;i++){
		in>>x>>y>>z>>a>>b>>c>>n;
		out<<iepuri(x,y,z,a,b,c,n)<<endl;
	}


}