lightoj 1006 水水....

#include<iostream>
#include<queue>
#include<stack>
#include<cstdio>
#include<memory.h>
#include<algorithm>
#include<vector>
using namespace std;
long long f[10001],n,u=0,T;
long long inf=10000007;
int main()
{
    cin>>T;
    while(T--)
    {
        cin>>f[0]>>f[1]>>f[2]>>f[3]>>f[4]>>f[5]>>n;
        for(int a=6;a<=n;a++)f[a]=((((((f[a-1]%inf+f[a-2]%inf)%inf+f[a-3]%inf)%inf+f[a-4]%inf)%inf+f[a-5]%inf)%inf+f[a-6]%inf)%inf);
        printf("Case %lld: %lld\n",++u,f[n]%inf);
    }
    return 0;
}