#include<bits/stdc++.h>
using namespace std;
int a, b, c, d, e, f;
int xx[10007];
void ch(int n)
{
 
    int i=0;
 
    for(i=0;i<n;i++)
    {
        xx[i]=-1;
    }
}
 
 
int fn( int n ) {
    if(xx[n]!=-1)
    {
        return xx[n];
    }
 
    if( n == 0 ) return a;
    if( n == 1 ) return b;
    if( n == 2 ) return c;
    if( n == 3 ) return d;
    if( n == 4 ) return e;
    if( n == 5 ) return f;
    xx[n]= fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) ;
    return xx[n];
}
int main() {
    int n, caseno = 0, cases;
    scanf("%d", &cases);
    while( cases-- ) {
        scanf("%d %d %d %d %d %d %d", &a, &b, &c, &d, &e, &f, &n);
        ch(n);
        printf("Case %d: %d\n", ++caseno, fn(n) % 10000007);
    }
    return 0;
}
 
 

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IGEsIGIsIGMsIGQsIGUsIGY7CmludCB4eFsxMDAwN107CnZvaWQgY2goaW50IG4pCnsKCiAgICBpbnQgaT0wOwoKICAgIGZvcihpPTA7aTxuO2krKykKICAgIHsKICAgICAgICB4eFtpXT0tMTsKICAgIH0KfQoKCmludCBmbiggaW50IG4gKSB7CiAgICBpZih4eFtuXSE9LTEpCiAgICB7CiAgICAgICAgcmV0dXJuIHh4W25dOwogICAgfQoKICAgIGlmKCBuID09IDAgKSByZXR1cm4gYTsKICAgIGlmKCBuID09IDEgKSByZXR1cm4gYjsKICAgIGlmKCBuID09IDIgKSByZXR1cm4gYzsKICAgIGlmKCBuID09IDMgKSByZXR1cm4gZDsKICAgIGlmKCBuID09IDQgKSByZXR1cm4gZTsKICAgIGlmKCBuID09IDUgKSByZXR1cm4gZjsKICAgIHh4W25dPSBmbihuLTEpICsgZm4obi0yKSArIGZuKG4tMykgKyBmbihuLTQpICsgZm4obi01KSArIGZuKG4tNikgOwogICAgcmV0dXJuIHh4W25dOwp9CmludCBtYWluKCkgewogICAgaW50IG4sIGNhc2VubyA9IDAsIGNhc2VzOwogICAgc2NhbmYoIiVkIiwgJmNhc2VzKTsKICAgIHdoaWxlKCBjYXNlcy0tICkgewogICAgICAgIHNjYW5mKCIlZCAlZCAlZCAlZCAlZCAlZCAlZCIsICZhLCAmYiwgJmMsICZkLCAmZSwgJmYsICZuKTsKICAgICAgICBjaChuKTsKICAgICAgICBwcmludGYoIkNhc2UgJWQ6ICVkXG4iLCArK2Nhc2VubywgZm4obikgJSAxMDAwMDAwNyk7CiAgICB9CiAgICByZXR1cm4gMDsKfQoK

NQoKMCAxIDIgMyA0IDUgMjEKCjMgMiAxIDUgMCAxIDkKCjQgMTIgOSA0IDUgNiAxNQoKOSA4IDcgNiA1IDQgMwoKMyA0IDMgMiA1NCA1IDQ=

5

0 1 2 3 4 5 21

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