#include <bits/stdc++.h>
using namespace std;
const int mx = 1e3 + 10;
const int mod = 1e8 + 7;
int dp[3][15100];
int sum[3][15100];
int main() {
int t, c = 0;
cin >> t;
while(t--){
int n, k , s ;
scanf("%d %d %d", &n, &k, &s);
for(int i = 0 ; i <= s; i++)
dp[0][i] = 0, sum[0][i] = 0;
for(int i = 1; i <= n; i++){
for(int j = 0 ; j <= s; j++ ){
if(i - 1 >= 0 && j-1 >= 0 && j-k-1 >= 0)
dp[i][j] = sum[i-1][j-1] - sum[i-1][j-k-1], sum[i][j] = sum[i][j-1] + dp[i][j];
else
dp[i][j] = sum[i][j] = 0;
}
}
printf("Case %d: %d\n", ++c, dp[n][s]);
}
// your code goes here
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBteCA9IDFlMyArIDEwOwpjb25zdCBpbnQgbW9kID0gMWU4ICsgNzsKCmludCBkcFszXVsxNTEwMF07CmludCBzdW1bM11bMTUxMDBdOwppbnQgbWFpbigpIHsKCWludCB0LCBjID0gMDsKCWNpbiA+PiB0OwoJd2hpbGUodC0tKXsKCQlpbnQgbiwgayAsIHMgOwoJCXNjYW5mKCIlZCAlZCAlZCIsICZuLCAmaywgJnMpOwoJCWZvcihpbnQgaSA9IDAgOyBpIDw9IHM7IGkrKykKCQkgICAgZHBbMF1baV0gPSAwLCBzdW1bMF1baV0gPSAwOwoJCWZvcihpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKXsKCQkJZm9yKGludCBqID0gMCA7IGogPD0gczsgaisrICl7CgkJIAkgIGlmKGkgLSAxID49IDAgJiYgai0xID49IDAgJiYgai1rLTEgPj0gMCkKCQkgCSAgCWRwW2ldW2pdID0gc3VtW2ktMV1bai0xXSAtIHN1bVtpLTFdW2otay0xXSwgc3VtW2ldW2pdID0gc3VtW2ldW2otMV0gKyBkcFtpXVtqXTsKCQkgCSAgCWVsc2UgCgkJIAkgIAlkcFtpXVtqXSA9IHN1bVtpXVtqXSA9IDA7CgkJCX0KCQl9CgkJcHJpbnRmKCJDYXNlICVkOiAlZFxuIiwgKytjLCBkcFtuXVtzXSk7Cgl9CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglyZXR1cm4gMDsKfQ==