#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
const int Maxn=1e2+10;
int T=0;
int fac[Maxn],mod,n,k;
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void work(){
    n=read();k=read();mod=read();++T;
    fac[0]=1;fr(i,1,n) fac[i]=1ll*fac[i-1]*i%mod;
    int ans=0;
    if(k>=n-1){printf("Case #%d: %d\n",T,fac[n]);return;}
    // type1:1-k:
    int now=fac[k],now1=0;add(now1,1ll*(n-k)*(n-k)%mod);add(now1,mod-(n-k-1));
    add(ans,1ll*now*now1%mod);
    // type2:(1-k+1)
    add(ans,1ll*k*fac[k]%mod*(n-k)%mod);
    printf("Case #%d: %d\n",T,ans);
}
inline void init(){
	int t=read();
	while(t--) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}