#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

int testcase;

inline void work() {
    int n = rd(), k = rd(), p = rd();
    k = min(n, k);
    int fac = 1, f = (n - k) * (n - 1) + 1;
    rep(i, 1, k) fac = 1ll * fac * i % p;
    printf("Case #%d: %lld\n", ++testcase, 1ll * f * fac % p);
}

int main() {
    per(t, rd(), 1) work();
    return 0;
}