#include<bits/stdc++.h>
using namespace std;
long long f[10005][1005];
long long n,k,p;
int main()
{
    cin>>n>>k>>p;
    f[1][1] = 1;
    for(int i=1;i<=n;i++)
    {
        f[i][1] = 1;
        for(int j=1;j<=k;j++)
        {
  f[i][j] = (f[i-1][j-1]%p + (f[i-1][j]%p)*(j%p))%p; 
            f[1][1] = 1;   
        }
    }
    cout<<f[n][k]; 
    return 0;
}