#include <bits/stdc++.h>
using namespace std;
const int mx = 1e3 + 10;
const int mod = 1e8 + 7;
int dp[mx][151];
int sum[mx][151];
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+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBteCA9IDFlMyArIDEwOwpjb25zdCBpbnQgbW9kID0gMWU4ICsgNzsKCmludCBkcFtteF1bMTUxXTsKaW50IHN1bVtteF1bMTUxXTsKaW50IG1haW4oKSB7CglpbnQgdCwgYyA9IDA7CgljaW4gPj4gdDsKCXdoaWxlKHQtLSl7CgkJaW50IG4sIGsgLCBzIDsKCQlzY2FuZigiJWQgJWQgJWQiLCAmbiwgJmssICZzKTsKCQlmb3IoaW50IGkgPSAwIDsgaSA8PSBzOyBpKyspCgkJICAgIGRwWzBdW2ldID0gMCwgc3VtWzBdW2ldID0gMDsKCQlmb3IoaW50IGkgPSAxOyBpIDw9IG47IGkrKyl7CgkJCWZvcihpbnQgaiA9IDAgOyBqIDw9IHM7IGorKyApewoJCSAJICBpZihpIC0gMSA+PSAwICYmIGotMSA+PSAwICYmIGotay0xID49IDApCgkJIAkgIAlkcFtpXVtqXSA9IHN1bVtpLTFdW2otMV0gLSBzdW1baS0xXVtqLWstMV0sIHN1bVtpXVtqXSA9IHN1bVtpXVtqLTFdICsgZHBbaV1bal07CgkJIAkgIAllbHNlIAoJCSAJICAJZHBbaV1bal0gPSBzdW1baV1bal0gPSAwOwoJCQl9CgkJfQoJCXByaW50ZigiQ2FzZSAlZDogJWRcbiIsICsrYywgZHBbbl1bc10pOwoJfQoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJcmV0dXJuIDA7Cn0=