// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
int mod;
typedef unsigned long long ull;
namespace FM{
	typedef __uint128_t L;
	struct FastMod{
		ull b,m;
		FastMod(ull b):b(b),m(ull((L(1)<<64)/b)){}
		ull reduce(ull a){ull q=(ull)((L(m)*a)>>64),r=a-q*b;return r>=b?r-b:r;}
	};
	FastMod F(2);
}

struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=FM::F.reduce(1ull*x*o.x),*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}
void initmod(){mod=read(),FM::F=FM::FastMod(mod);}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000005
#define inf 0x3f3f3f3f

int n,m,k;

modint dp[105][105];
void solve1(){
	dp[0][0]=1;
	For(i,1,m){
		For(j,0,i)
			dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*iv[i];
	}
	cout<<dp[m][n].x<<"\n";
	exit(0);
}

modint f[105][5505][2];
void solve2(){
	f[0][0][0]=1;
	int sum=0;
	For(i,1,m){
	//	cout<<"sum "<<sum<<"\n";
		Rep(j,i-1,0)Rep(k,sum,0)For(o,0,1)if(f[j][k][o].x){
			if(!o) f[j+1][k+i][1]+=f[j][k][o]*i; // *i
			f[j+1][k][o]+=f[j][k][o]*iv[i];9
			f[j+1][k+i][o]-=f[j][k][o]*iv[i];
		}
		sum+=i;
	}
	modint res=0;
	For(k,0,sum)res+=f[n][k][1]*iv[k];
	cout<<res.x;
	exit(0);
}

signed main()
{
	n=read(),m=read(),k=read(),initmod();initC(10005);
	if(k==1)solve1();
	else solve2();
	return 0;
}
/*
3 1
1 0 0 0
*/

answer.code: In function ‘void solve2()’:
answer.code:107:57: error: expected ‘;’ before ‘f’
  107 |                         f[j+1][k][o]+=f[j][k][o]*iv[i];9
      |                                                         ^
      |                                                         ;
  108 |                         f[j+1][k+i][o]-=f[j][k][o]*iv[i];
      |                         ~