// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
unsigned MOD;
struct mint
{
    unsigned v;
    mint(unsigned v_ = 0) : v(v_) {}
    mint operator-() const { return v ? MOD - v : *this; }
    mint &operator+=(const mint &X) { return (v += X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator-=(const mint &X) { return (v += MOD - X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator*=(const mint &X) { return v = 1llu * v * X.v % MOD, *this; }
    mint &operator/=(const mint &X) { return *this *= X.inv(); }
    mint pow(long long B) const
    {
        B %= MOD - 1;
        if (B < 0)
            B += MOD - 1;
        mint res = 1, A = *this;
        while (B)
        {
            if (B & 1)
                res *= A;
            B >>= 1;
            A *= A;
        }
        return res;
    }
    mint inv() const { return pow(MOD - 2); }
    friend mint operator+(const mint &A, const mint &B) { return mint(A) += B; }
    friend mint operator-(const mint &A, const mint &B) { return mint(A) -= B; }
    friend mint operator*(const mint &A, const mint &B) { return mint(A) *= B; }
    friend mint operator/(const mint &A, const mint &B) { return mint(A) /= B; }
    friend std::istream &operator>>(std::istream &A, mint &B) { return A >> B.v; }
    friend std::ostream &operator<<(std::ostream &A, const mint &B) { return A << B.v; }
    friend bool operator==(const mint &A, const mint &B) { return A.v == B.v; }
    explicit operator bool() const { return v; }
} pw3[32769], pW3[32769], pwq[32769], pWq[32769], fact[10000005], ifact[10000005], f[10000005], g[10000005], ans;
int n, q;
mint get3(long long p) { return p %= MOD - 1, pw3[p & 32767] * pW3[p >> 15]; }
mint getq(long long p) { return p %= MOD - 1, pwq[p & 32767] * pWq[p >> 15]; }
mint down(int n, int m) { return fact[m] * getq((n * 2ll - m - 1) * m / 2); }
mint C(int n, int m) { return 0 <= m && m <= n ? fact[n] * ifact[n - m] * ifact[m] : 0; }
void init()
{
    pw3[0] = 1;
    for (int i = 1; i <= 32768; ++i)
        pw3[i] = pw3[i - 1] * 3;
    pW3[0] = 1;
    for (int i = 1; i <= 32768; ++i)
        pW3[i] = pW3[i - 1] * pw3[32768];
    pwq[0] = 1;
    for (int i = 1; i <= 32768; ++i)
        pwq[i] = pwq[i - 1] * q;
    pWq[0] = 1;
    for (int i = 1; i <= 32768; ++i)
        pWq[i] = pWq[i - 1] * pwq[32768];
    fact[0] = 1;
    for (int i = 1; i <= n; ++i)
        fact[i] = fact[i - 1] * (getq(i) - 1);
    ifact[n] = fact[n].inv();
    for (int i = n; i; --i)
        ifact[i - 1] = ifact[i] * (getq(i) - 1);
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> q >> MOD;
    init();
    g[0] = 1;
    for (int i = 1; i <= n; ++i)
        g[i] = -getq(i - 1) * g[i - 1] * ifact[i] * fact[i - 1];
    f[0] = g[0];
    for (int i = 1; i <= n; ++i)
        f[i] = ((getq(n) - getq(i - 1)) * f[i - 1] + g[i]) * getq(MOD - 1 - i);
    int t = 1;
    for (int i = 1; i <= n; ++i)
        t = 1ll * t * q % (MOD - 1);
    for (int i = 0, j = 1; i <= n; ++i, j = 1ll * j * t % (MOD - 1))
        ans += get3(j) * f[n - i] * fact[n] * ifact[i];
    std::cout << ans << std::endl;
    return 0;
}