N,M,K=map(int,input().split())

T=max(M,K)+1
mod=998244353

dp=[[0]*(T+1) for i in range(N+1)]

dp[0][0]=1

for i in range(1,T+1):
    ndp=[[0]*(T+1)for i in range(N+1)]
    for k in range(i):
        X=pow(i,max(0,min(i,K)-k),mod)
        for j in range(min(i,N+1)):
            if i<=M and j<N:
                ndp[j+1][k]=(ndp[j+1][k]+dp[j][k])%mod
            
            ndp[j][i]=(ndp[j][i]+dp[j][k]*X%mod)%mod
    dp,ndp=ndp,dp

S=[[0]*(N+1)for i in range(N+1)]
S[0][0]=1
for i in range(N):
    for j in range(i+1):
        S[i+1][j]=(S[i+1][j]+S[i][j]*j)%mod
        S[i+1][j+1]=(S[i+1][j+1]+S[i][j])%mod

fac=[0]*(N+1)
fac[0]=1

for i in range(1,N+1):fac[i]=(i*fac[i-1])%mod

ans=0

for i in range(1,N+1):
    ans=(ans+dp[i][T]*S[N][i]%mod*fac[i]%mod)%mod

print(ans)