#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

template<long long mod,long long MAX_N>
struct factional_prime{
	long long inv_[MAX_N+1];
	long long fac_[MAX_N+1];
	long long fac_inv_[MAX_N+1];

	factional_prime(){
		inv_[0]=0;inv_[1]=fac_[0]=fac_[1]=fac_inv_[0]=fac_inv_[1]=1;
		for(long long i=2;i<=MAX_N;i++){
			inv_[i]=((mod-mod/i)*inv_[mod%i])%mod;
			fac_[i]=(fac_[i-1]*i)%mod;
			fac_inv_[i]=(fac_inv_[i-1]*inv_[i])%mod;
		}
	}
	long long inv(long long n){
		if(n<0)return 0;
		return inv_[n];
	}
	long long fac(long long n){
		if(n<0)return 0;
		return fac_[n];
	}
	long long finv(long long n){
		if(n<0)return 0;
		return fac_inv_[n];
	}
	long long nCr(long long n,long long r){
		if(n<r||n<0||r<0)return 0;
		return ((fac_[n]*fac_inv_[n-r])%mod*fac_inv_[r])%mod;
	}
	long long nPr(long long n,long long r){
		if(n<r||n<0||r<0)return 0;
		return (fac_[n]*fac_inv_[n-r])%mod;
	}
};

factional_prime<998244353,1000> fp;

mint dp[89][89][89];

int main(){
	int N,M,K;cin>>N>>M>>K;

	dp[0][0][0]=1;

	int T=max(M,K)+2;

	auto g=[&](int l,int r){
		
	};

	for(int i=1;i<=T;i++){
		for(int j=0;j<=N;j++){
			for(int k=0;k<=i-1;k++){
				//0
				if(k<K){
					dp[i][j][i]+=dp[i-1][j][k]*mint(i).pow(min(K,i)-k);
				}else{
					dp[i][j][i]+=dp[i-1][j][k];
				}
				if(i<=M&&j<N){
					//1
					dp[i][j+1][k]+=dp[i-1][j][k];
				}
			}
		}
	}

	mint ans=0;

	for(int i=1;i<=N;i++){
		mint sum=0;
		for(int j=0;j<=i;j++){
			sum+=mint(j).pow(N)*mint(-1).pow(i-j)*fp.nCr(i,j);
		}
		mint sum2=0;
		for(int j=0;j<=T;j++){
			sum2+=dp[T][i][j];
		}
		ans+=sum*sum2;
	}

	cout<<ans.val()<<endl;
}