#include <bits/stdc++.h>
using namespace std;
namespace Slongod{
const int N = 55; int frac[N];
void main()
{
    int T , n , k , mod; cin >> T;
    for (int c = 1; c <= T; c++) {
        cin >> n >> k >> mod; k = min(k , n); frac[0] = 1; for (int i = 1; i <= k; i++){frac[i] = 1ll * frac[i-1] * i % mod;}
        cout << "Case #" << c << ": " << (1ll * k * (n - k) * frac[k] % mod + 1ll * (n - k) * (n - k - 1) * frac[k] % mod + frac[k]) % mod << '\n';
    }
}
}int main()
{
    ios :: sync_with_stdio(0);
    cin.tie(0) , cout.tie(0);
    return Slongod :: main(),0;
}