/*
ID: untamed
PROG: DICE1
LANG: C++
*/

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<limits>
#include<climits>
#include<cmath>
#include<functional>
#include<ctime>
#include<cstdlib>
#include<fstream>
#include<typeinfo>

const int ONE = 1<<10;
const int TWO = 1<<11;
const int FOUR = 1<<12;
const int EIGHT = 1<<13;
const int SIXTEEN = 1<<14;
const int THIRTY = 1<<15;
const int SIXTY = 1<<16;
const int ONE_HUNDRED = 1<<17;
const int TWO_HUNDRED = 1<<18;
const int FIVE_HUNDRED = 1<<19;
const int MILLION = 1<<20;

using namespace std;

typedef long long int ll;
typedef short int i16;
typedef unsigned long long int u64;
typedef unsigned int u32;
typedef unsigned short int u16;
typedef unsigned char u8;

const int MOD = 100000007;

int f(int p)
{
    if(p<0)
        return 0;
    return p;
}

int n,k,s;

int state[2][SIXTEEN];
int sum[2][SIXTEEN];

void input()
{
    memset(state,0,sizeof(state));
    memset(sum,0,sizeof(sum));
    scanf("%d %d %d", &n, &k, &s);
}

void solve()
{
    int i,j,z;
    for(i=1;i<=k;i++)
    {
        state[1][i]=1;
        sum[1][i]=sum[1][i-1]+1;
    }
    for(i=k+1;i<=s;i++)
        sum[1][i]=sum[1][i-1];
    for(i=2;i<=n;i++)
    {
        for(j=1;j<=s;j++)
        {
            state[(i&1)][j]=(sum[(i&1)^1][f(j-1)]-sum[(i&1)^1][f(j-k-1)]+MOD)%MOD;
            sum[(i&1)][j]=(sum[(i&1)][j-1]+state[(i&1)][j])%MOD;
        }
    }
    printf("%d\n", state[n&1][s]);
}

int main()
{
    int i,t;
    scanf("%d", &t);
    for(i=1;i<=t;i++)
    {
        input();
        printf("Case %d: ", i);
        solve();
    }
    return 0;
}