#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 1145;

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

int a[N][N];

int f[N][N];
int det(int n) {
	int p = 1;
	L(i, 1, n) {
		L(j, p + 1, n) {
			while(f[j][i]) {
				int t = f[p][i] / f[j][i];
				L(k, i, n) (f[p][k] += q - (ll) f[j][k] * t % q) %= q;
				swap(f[p], f[j]);
			}
		}
		if(f[p][i]) ++p;
	}
	return p - 1;
}

int ans[N];

void search(int x, int y) {
	if(y == n + 1) ++x, y = 1;
	if(x == n + 1) {
		L(i, 1, n) {
			L(j, 1, n) {
				f[i][j] = a[i][j];
			}
		} 
		if(det(n) != n) 
			return ;
		
		L(i, 1, n) {
			L(j, 1, n) {
				f[i][j] = a[i][j];
			}
		} 
		
		L(i, 1, n) 
			(f[i][i] += q - 1) %= q;
//		L(i, 1, n) {
//			L(j, 1, n) {
//				cout << f[i][j] << ' ';
//			}
//			cout << '\n';
//		}
//		cout << '\n';
		
//		cout << "det : " << det(n) << '\n';

		ans[det(n)] += 1;
		return ; 
	}
	L(i, 0, q - 1) {
		a[x][y] = i;
		search(x, y + 1);
	}
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> q >> mod; 
	search(1, 1);
	int pw = 1, s = 1;
	L(i, 1, n) pw = (ll) pw * q % (mod - 1);
	int ns = 0;
	R(i, n, 0) {
		(ns += (ll) ans[i] * qpow(3, s) % mod) %= mod;
		s = (ll) s * pw % (mod - 1);
	}
	cout << ns << '\n';
	return 0;
}