#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_pbds;
using ordered_multiset=tree<int,null_type,less_equal<int>,
rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
ll frac(ll n,ll q){
    ll res=1;
    for(int i=1;i<=n;i++){
        res=res*i;
        res=res%q;
    }
    return res;
}
void solve(){
    ll n,k,q;
    cin>>n>>k>>q;
    ll ans=0,res=0;
    if(k==1){
        ans=1,res=1;
        for(int i=2;i<=n;i++){
            ans=ans+res;
            ans=ans%q;
            res=res+2;
            res=res%q;
        }
        cout<<ans;
        return;
    }
    ll frc=frac(k,q);
    ans=frc;
    res=frc*k;
    res=res%q;
    for(int i=k+1;i<=n;i++){
        ans=ans+res;
        ans=ans%q;
        res=res+2*frc;
        res=res%q;
    }
    cout<<ans;
    return;
}
int main(){
    int T;
    cin>>T;
    for(int _=1;_<=T;_++){
        cout<<"Case #"<<_<<": ";
        solve();
        cout<<endl;
    }
    return 0;
}