Hexa Bonacci

/*
 *@Author: Kabid Hasan
 *@Date: Tuesday 2021-Nov-23
 *@Time: 02:07:49
 */
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 10000007;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin()                    \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

ll d[10001];
int it;
ll dp(ll n)
{
    if (d[n]==-1)
    {
        d[n] = (((((dp(n - 1) + dp(n - 2)) % MOD + dp(n - 3)) % MOD + dp(n - 4)) % MOD + dp(n - 5)) % MOD + dp(n - 6)) % MOD;
    }
    return d[n];
}
void solve()
{
    ll n;
    fill(d,d+10001,-1);
    scanf("%lld %lld %lld %lld %lld %lld %lld", &d[0], &d[1], &d[2], &d[3], &d[4], &d[5], &n);
    //cout << d[0] << ' ' << n << endl;

    printf("Case %d: %lld\n", it, dp(n));
}
int main()
{
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r+", stdin);
    //     freopen("output.txt", "w+", stdout);
    // #endif
    ll t = 1;
    cin >> t;

    for (it = 1; it <= t; it++)
    {
        // cout << "Case #" << it+1 << ": ";
        solve();
    }
    return 0;
}