#include <iostream>
#include <cstring>
#include <cstdio>
 
#define maxn 10003
using namespace std;
long long fn[maxn];
int main() {
	// your code goes here
	int n, cases, caseno=0, i;
	cin >> cases;
	while (cases--) {
		fn[6]=0;
		for (i=0;i<6;i++) {
			scanf("%lld",&fn[i]); fn[i]=fn[i]%10000007;
			fn[6]=(fn[6]+fn[i])%10000007;
		}
		cin >> n;
		for (i=7;i<=n;i++) {
			fn[i]=(fn[i-6]+fn[i-5]+fn[i-4]+fn[i-3]+fn[i-2]+fn[i-1])%10000007;
		}
		cout<<"Case "<<++caseno<<": "<<fn[n]<<endl;
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0cmluZz4KI2luY2x1ZGUgPGNzdGRpbz4KCiNkZWZpbmUgbWF4biAxMDAwMwp1c2luZyBuYW1lc3BhY2Ugc3RkOwpsb25nIGxvbmcgZm5bbWF4bl07CmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG4sIGNhc2VzLCBjYXNlbm89MCwgaTsKCWNpbiA+PiBjYXNlczsKCXdoaWxlIChjYXNlcy0tKSB7CgkJZm5bNl09MDsKCQlmb3IgKGk9MDtpPDY7aSsrKSB7CgkJCXNjYW5mKCIlbGxkIiwmZm5baV0pOyBmbltpXT1mbltpXSUxMDAwMDAwNzsKCQkJZm5bNl09KGZuWzZdK2ZuW2ldKSUxMDAwMDAwNzsKCQl9CgkJY2luID4+IG47CgkJZm9yIChpPTc7aTw9bjtpKyspIHsKCQkJZm5baV09KGZuW2ktNl0rZm5baS01XStmbltpLTRdK2ZuW2ktM10rZm5baS0yXStmbltpLTFdKSUxMDAwMDAwNzsKCQl9CgkJY291dDw8IkNhc2UgIjw8KytjYXNlbm88PCI6ICI8PGZuW25dPDxlbmRsOwoJfQoJcmV0dXJuIDA7Cn0=

NQowIDEgMiAzIDQgNSAyMAozIDIgMSA1IDAgMSA5CjQgMTIgOSA0IDUgNiAxNQo5IDggNyA2IDUgNCAzCjMgNCAzIDIgNTQgNSA0

5
0 1 2 3 4 5 20
3 2 1 5 0 1 9
4 12 9 4 5 6 15
9 8 7 6 5 4 3
3 4 3 2 54 5 4