#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define int long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e5+5;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
int a[maxn]; 
int fac[maxn];
inline int calc(int n)
{
    if(n==0) return 0;
    int res=0;
    rep(i,1,n) res+=n-i;
    rep(i,1,n-1) res+=n-i-1;
    return res+1;
}
signed main()
{
	T=read();
    rep(P,1,T)
    {
        // printf("%lld\n",calc(2));
        int n=read(),k=read(),mod=read();
        printf("Case #%lld: ",P);
        if(k==1) {printf("%lld\n",calc(n)%mod);continue;}
        if(k==2) {printf("%lld\n",(max(0ll,(n-3)*2)%mod+2*(n-2)%mod*2%mod+2*calc(n-2)%mod)%mod);continue;}
        fac[0]=1;
        rep(i,1,k) fac[i]=fac[i-1]*i%mod;
        if(k==n) {printf("%lld\n",fac[k]%mod);continue;}
        int ans=k*fac[k]%mod*max(1ll,(n-k))%mod;
        // printf("%lld\n",ans);
        ans+=calc(n-k)*fac[k]%mod;ans%=mod;
        printf("%lld\n",ans);
    }
}