#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<cmath>

#include<algorithm>

#include<cstring>

#define ll long long

using namespace std;

ll f[71][105][71];

//f[i][j][k] means the number of binary_numbers,which has i digits(without 0 before the first 1)

//and k digits of 1.And it's equal to j (mod K)

int T,n,k,cnt;

inline int add(int x,int y,const int ha){

	x+=y;

	if(x>=ha) return x-ha;

	else return x;

}

inline void dp(){

    memset(f,0,sizeof(f));

    f[1][!(k==1)][1]=1;

    for(int i=1;i<n;i++)

        for(int j=0;j<k;j++)

            for(int l=1;l<=i;l++) if(f[i][j][l]){

            ll base=f[i][j][l];

            int to=add(j,j,k);

            f[i+1][to][l]+=base;

            to=add(to,1,k);

            f[i+1][to][l+1]+=base;

        }

}

int main(){

    scanf("%d",&T);

    while(T--){

        scanf("%d%d",&n,&k);

        printf("Case %d: ",++cnt);

        if((n&1)||!k){

            puts("0");

            continue;

        }

        dp();

        printf("%lld\n",f[n][0][n>>1]);

    }

    return 0;

}