#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(234);
const ll inf = 1e18;
;

ll bin_pow(ll x, ll n, ll m) {
    if (n == 0) {
        return 1;
    }
    ll a = bin_pow(x, n / 2, m);
    a = (a * a) % m;
    if (n & 1) {
        a = (a * x) % m;
    }
    return a;
}

ll rev(ll x, ll m) {
    return bin_pow(x, m - 2, m);
}

ll n, q, mod;

ll biba(ll r) {
    ll a = (bin_pow(q, r + 1, mod) - 1) * rev(q - 1, mod) % mod;
    a = bin_pow(a, n - r, mod);
    ll b = bin_pow(q, r * (r - 1) / 2, mod);
    ll c = 1;
    for (ll i = 0; i < r; i += 1) {
        c = (c * (bin_pow(q, n - i, mod) - 1)) % mod;
    }
    return a * b % mod * c % mod;
}

ll get_rank(vector<vector<ll>> a, ll n, ll m) {
    int j = 0;
    for (int i = 0; i < n; i += 1) {
        int t = -1;
        for (int k = j; k < n; k += 1) {
            if (a[k][i] != 0) {
                t = k;
                break;
            }
        }
        if (t == -1) {
            continue;
        }
        swap(a[t], a[j]);
        ll f = rev(a[j][i], m);
        for (int k = 0; k < n; k += 1) {
            a[j][k] = (a[j][k] * f) % m;
        }
        for (int k = j + 1; k < n; k += 1) {
            if (a[k][i] != 0) {
                ll g = a[k][i];
                for (int q = 0; q < n; q += 1) {
                    a[k][q] = (a[k][q] + m - a[j][q] * g % m) % m;
                }
            }
        }
        j += 1;
    }
    return j;
}

ll solve_slow(vector<vector<ll>> &b, int i) {
    if (i == n * n) {
        if (get_rank(b, n, q) != n) {
            return 0;
        }
        auto bi = b;
        for (int i = 0; i < n; i += 1) {
            bi[i][i] = (bi[i][i] + q - 1) % q;
        }
        ll rnk = get_rank(bi, n, q);
        ll pw = bin_pow(q, n * (n - rnk), mod - 1);
        ll rs = bin_pow(3, pw, mod);
        return rs;
    }
    ll rs = 0;
    for (int f = 0; f < q; f += 1) {
        b[i / n][i % n] = f;
        rs = (rs + solve_slow(b, i + 1)) % mod;
    }
    return rs;
}

ll solve_slow() {
    vector<vector<ll>> b(n, vector<ll>(n));
    ll rs = solve_slow(b, 0);
    return rs;
}

ll solve() {
    ll sm = 0;
    for (ll r = 0; r <= n; r += 1) {
        ll b = biba(r);
        sm = (sm + b) % mod;
    }
    cout << sm << " " << bin_pow(q, n * n, mod) << "\n";
    return sm;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> q >> mod;
    ll rs = solve_slow();
    cout << rs << "\n";
    return 0;
}

/*
3 2 1000000007

1 1 1000000007

*/