# include <bits/stdc++.h>

using namespace std;

long n, m, p;

inline long pow(long a, long n) {
  long r(1);
  while (n) {
    r = r * (n & 1 ? a : 1) % p;
    a = a * a % p, n >>= 1;
  }
  return r;
}
inline long inv(long x) {
  x = (x % p + p) % p;
  assert(x);
  if (!x) return 0;
  long res(1);
  while (x != 1)
    res = p - res * (p / x) % p, x = p % x;
  return res;
}

inline long s0(long const n, long c) {
  switch (c %= p) {
    case 1 : return n;
    default: return 1l * (1 - pow(c, n)) % p * inv(1 - c) % p;
  }
}
inline long s1(long const n, long c) {
  if ((c %= p) == 1) return 1l * n * (n + 1) / 2;
  long const v0((1 - pow(c, n)) * inv(1 - c) % p);
  long const v1(n * pow(c, n) % p);
  return (v0 - v1) * inv(1 - c) % p;
}
inline void tr(long& a, long& b, long l, long r, long c) {
  if (l == r) return;
  // cerr << __func__ << ' ' << a << ' ' << b << ' ';
  // cerr << l << ' ' << r << ' ' << c << endl;
  b = (b + 1l * a * c % p * r % p * s0(r - l, c + 1)) % p;
  b = (b - 1l * a * c % p * 1 % p * s1(r - l, c + 1)) % p;
  a = 1l * a * pow((c + 1) % p, r - l) % p;
  // cerr << "--->" << ' ' << a << ' ' << b << endl;
}

int main() {
  long t;
  cin >> t;
  for (long i(1); i <= t; ++i) {
    cin >> n >> m >> p;
    if (n == 1) {
      cout << 0 << endl;
      continue;
    }
    long a(1), b(0);
    if (m < n - 1) {
      tr(a, b, n - m, n, 1);
      tr(a, b, 1, n - m, 0);
    } else {
      long const q((m - (n - 2)) / (n - 1));
      long const r((m - (n - 2)) % (n - 1));
      long const p(n - r);
      tr(a, b, p, n, (q + 2) % ::p);
      tr(a, b, 2, p, (q + 1) % ::p);
      tr(a, b, 1, 2, (q + 0) % ::p);
    }
    cout << (b = (b + (n - 1) + p) % p) << endl;
  }
}