lightoj 1006 mmm

#include<iostream>
#include<cstdio>

using namespace std;

long  a, b, c, d, e, f;
unsigned long long ans[10010];
unsigned long long fn( int n ) {
    if( n == 0 ) return a;
    else if( n == 1 ) return b;
    else if( n == 2 ) return c;
    else if( n == 3 ) return d;
    else if( n == 4 ) return e;
    else if( n == 5 ) return f;
    else if(ans[n]==-1) ans[n]=( fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) );

    return ans[n];
}
int main() {
    int n, caseno = 0, cases;
    scanf("%ld", &cases);
    while( cases-- ) {
        for(int i=0;i<10010;i++)
            ans[i]=-1;
        scanf("%ld %ld %ld %ld %ld %ld %d", &a, &b, &c, &d, &e, &f, &n);
        unsigned long long i=fn(n);
        //cout<<fn(n)%10000007<<endl;
        i=i % 10000007;

        printf("Case %d: %llu\n", ++caseno,i);
    }
    return 0;
}