#include<bits/stdc++.h>
using namespace std;
const int maxn=55;
int fac[maxn];
int main()
{
    int _;
    cin>>_;
    int i=0;
    while(_--)
    {
        ++i;
        int n,k,mod;
        cin>>n>>k>>mod;
        k=min(k,n);
        fac[0]=1;
        for(int i=1;i<=50;i++)
            fac[i]=1ll*fac[i-1]*i%mod;
        int s=0;
        (s+=(1ll*fac[k]*((1ll*(n-k)*(n-k-1)%mod-(n-k)+1+mod)%mod)%mod+fac[k])%mod)%=mod;
        // cout<<s<<' '<<((n-k)*(n-k-1)-(n-k))<<'\n';
        (s+=1ll*k*fac[k]%mod*(n-k)%mod)%=mod;
        // cout<<s<<'\n';
        (s+=1ll*fac[k]*(n-k-1)%mod)%=mod;
        if(k>n-1) 
            s=fac[n-1]; 
        cout<<"Case #"<<i<<": "<<s<<'\n';
    }

    return 0;
}