#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
// Barrett
struct ModInt {
  static unsigned M;
  static unsigned long long NEG_INV_M;
  static void setM(unsigned long long m) { M = m; NEG_INV_M = -1ULL / M; }
  unsigned x;
  ModInt() : x(0U) {}
  ModInt(unsigned x_) : x(x_ % M) {}
  ModInt(unsigned long long x_) : x(x_ % M) {}
  ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) {
    const unsigned long long y = static_cast<unsigned long long>(x) * a.x;
    const unsigned long long q = static_cast<unsigned long long>((static_cast<unsigned __int128>(NEG_INV_M) * y) >> 64);
    const unsigned long long r = y - M * q;
    x = r - M * (r >= M);
    return *this;
  }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
unsigned ModInt::M;
unsigned long long ModInt::NEG_INV_M;
// !!!Use ModInt::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModInt;


struct Power {
  static constexpr int E = 16;
  vector<Mint> baby, giant;
  Power() {}
  Power(Mint a) : baby((1 << E) + 1), giant(1 << E) {
    baby[0] = 1;
    for (int i = 1; i <= 1 << E; ++i) baby[i] = baby[i - 1] * a;
    giant[0] = 1;
    for (int i = 1; i < 1 << E; ++i) giant[i] = giant[i - 1] * baby[1 << E];
  }
  Mint operator()(unsigned e) const {
    return giant[e >> E] * baby[e & ((1 << E) - 1)];
  }
};

/*
  U \subseteq F^N, subspace
  a(U) := #{ p \in Aut(F^N) | Ker(p - id) = U }
  b(U) := #{ p \in Aut(F^N) | p|_U = id }
  b(U) = \sum[V \supseteq U] a(V)
  
  a[dim(U)] := a(U)
  b[dim(U)] := b(U)
  b[i] = \sum[j>=i] qbinom(N-i, N-j) a[j]
  reverse a, b
  b[i] = \sum[j<=i] qbinom(i, j) a[j]
  
  b[i] = (q^N-q^(N-i)) ... (q^N-q^(N-1))
  
  A(x) := \sum[i] a[i] x^i / (q;q)_i
  B(x) := \sum[i] b[i] x^i / (q;q)_i
  B(x) = A(x) / (x;q)_INF
  A(x) = B(x) (x;q)_INF
  
  B(x) = \sum[i] (-1)^i q^(binom(N,2)-binom(N-i,2)) x^i
  x B(x) = \sum[i>=0] (-1)^i q^(binom(N,2)-binom(N-i,2)) x^i
         = \sum[i>=1] (-1)^(i-1) q^(binom(N,2)-binom(N-i+1,2)) x^i
         = \sum[i>=1] (-1)^i q^(binom(N,2)-binom(N-i,2)) (-1) q^(i-N) x^i
  B(qx) = 1 - q^N x B(x)
  A(qx) = B(qx) (qx;q)_INF
        = (1 - q^N x B(x)) (x;q)_INF / (1-x)
  (1-x) A(qx) = (x;q)_INF - q^N x A(x)
  
  take [x^i/(q;q)_i]
  q^i a[i] - q^(i-1) (1-q^i) a[i-1] = (-1)^i q^(binom(i,2)) - q^N (1-q^i) a[i-1]
*/

int main() {
  int N, Q, M;
  for (; ~scanf("%d%d%d", &N, &Q, &M); ) {
    Mint::setM(M);
    
    const Mint q = Q;
    const Mint invQ = q.inv();
    vector<Mint> qq(N + 1), qq2(N + 1);
    qq[0] = 1;
    qq2[0] = 1;
    for (int i = 1; i <= N; ++i) {
      qq[i] = qq[i-1] * q;
      qq2[i] = qq2[i-1] * qq[i-1];
    }
    int ord = N + 1;
    for (int i = 1; i <= N; ++i) if (qq[i] == 1) {
      ord = i;
      break;
    }
    vector<Mint> fac(N + 1), invFac(N + 1);
    fac[0] = 1;
    for (int i = 1; i <= N; ++i) {
      fac[i] = fac[i-1] * i;
    }
    invFac[N] = fac[N].inv();
    for (int i = N; i >= 1; --i) {
      invFac[i-1] = i * invFac[i];
    }
    vector<Mint> fs(ord), invFs(ord);
    fs[0] = 1;
    for (int i = 1; i < ord; ++i) {
      fs[i] = fs[i-1] * (1 - qq[i]);
    }
    invFs[ord-1] = fs[ord-1].inv();
    for (int i = ord; --i >= 1; ) {
      invFs[i-1] = (1 - qq[i]) * invFs[i];
    }
    auto qb = [&](int n, int k) -> Mint {
      const int nq = n / ord, nr = n % ord;
      const int kq = k / ord, kr = k % ord;
      if (kr > nr) return 0;
      return (fac[nq] * invFac[kq] * invFac[nq - kq]) * (fs[nr] * invFs[kr] * invFs[nr - kr]);
    };
    
    vector<Mint> as(N + 1);
    as[0] = 1;
    {
      Mint iqq = 1;
      for (int i = 1; i <= N; ++i) {
        iqq *= invQ;
        as[i] = iqq * (((i&1)?-1:+1) * qq2[i] + (qq[i-1] - qq[N]) * (1 - qq[i]) * as[i - 1]);
      }
    }
// cerr<<"as = "<<as<<endl;
    for (int i = 0; i <= N; ++i) {
      as[i] *= qb(N, i);
    }
// cerr<<"as = "<<as<<endl;
    
    Int qn = 1;
    for (int i = 0; i < N; ++i) {
      (qn *= Q) %= (M - 1);
    }
    if (qn == 0) qn = M - 1;
    
    const Power three(3);
    Mint ans = 0;
    Int e = 1;
    for (int i = 0; i <= N; ++i) {
      ans += three(e) * as[N - i];
      (e *= qn) %= (M - 1);
    }
    printf("%u\n", ans.x);
  }
  return 0;
}