# include <bits/stdc++.h>
# define ll long long

using namespace std;

const int N = 2e5 + 5;
ll fac[N], ifac[N];
ll mod = 1e9 + 7;

ll qp(ll x, int y = mod - 2) {
  ll res = 1;
  for (; y; y >>= 1, x = x * x % mod) {
    if (y & 1) {
      res = res * x % mod;
    }
  }
  return res;
}

void init() {
  fac[0] = 1;
  for (int i = 1; i < N; i++) {
    fac[i] = fac[i - 1] * i % mod;
  }
  ifac[N - 1] = qp(fac[N - 1]);
  for (int i = N - 1; i; i--) {
    ifac[i - 1] = ifac[i] * i % mod;
  }
}

int main() {
# ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
# endif
  init();
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  int T; cin >> T;
  for (int i = 1; i <= T; i++) {
    int n, k;
    cin >> n >> k >> mod;k = min(n, k);
    cout << "Case #" << i << ": " << fac[k] * (k * (n - k) + (n - k) * (n - k - 1) + (n - k) - (n - 1 - k)) % mod << '\n';
  }
}