#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=55,M=1e5+5,mods=998244353;
int pows(int a,int b){
	if(b==0)return 1;
	int res=pows(a,b>>1);
	res=res*res%mods;
	if(b&1)res=res*a%mods;
	return res;
}
int n,m,qs,f[N][N],jc[M],ny[M];
int C(int a,int b){
	if(a<0||b<0||a<b)return 0;
	return jc[a]*ny[b]%mods*ny[a-b]%mods;
}
signed main(){
	cin>>n>>m>>qs;
	jc[0]=ny[0]=1;
	for(int i=1;i<=n*m;i++)jc[i]=jc[i-1]*i%mods,ny[i]=pows(jc[i],mods-2);
	f[0][n]=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<=n;j++){
			for(int k=0;k<=j;k++){
				int sm=0;
				for(int l=0;l<=m;l++){
					int ans=0;
					for(int r=0;r<=k;r++){
						int tmp=pows(k-r,m-l)*C(k,r)%mods;
						if(r&1)ans-=tmp;
						else ans+=tmp;
					}
					ans%=mods;
					sm+=C(m,l)*pows(n-j-i,l)%mods*ans%mods*pows(i+1,k)%mods*C(j,k)%mods;
				}
				f[i+1][j-k]+=f[i][j]*sm%mods;
			}
		}
		for(int j=0;j<=n;j++){
			f[i+1][j]%=mods;
	//		cout<<i+1<<" "<<j<<" "<<f[i+1][j]<<endl;
		}
	}
	cout<<(f[n][0]+mods)%mods;
}