#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5;

int n,m,Mod,fac[55];

int main()
{
    // freopen("1.in","r",stdin);

    int T; cin>>T;
    For(_,1,T)
    {
        cin>>n>>m>>Mod; m=min(n,m),fac[0]=1;
        For(i,1,n) fac[i]=1ll*fac[i-1]*i%Mod;
        int ans=1ll*(n-m)*fac[m]%Mod;
        ans=(ans+1ll*(n-m)*n*fac[m])%Mod;
        ans=(ans-1ll*fac[m]*(n-m-1)%Mod+Mod)%Mod;
        ans=(ans-1ll*(n-m)*fac[m]%Mod+Mod)%Mod;
        printf("Case #%d: %d\n",_,ans);
    }
    return 0;
}