#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all> 
using namespace atcoder;
using mint = modint998244353;
#define int long long
vector<mint> kai,inv;
mint f(int n, int k) {
  if(n < k) return 0;
  return kai[n]*inv[k]*inv[n-k];
}
signed main() {
  int n,m,s;
  cin >> n >> m >> s;
  kai.resize(n+1);
  inv.resize(n+1);
  kai[0] = 1, inv[0] = 1;
  for(int i = 1; i <= n; i++) kai[i] = kai[i-1]*i, inv[i] = inv[i-1]/mint(i);
  mint ans = 0;
  vector<vector<mint>> dp(m+1,vector<mint>(n+1,0));
  dp[0][0] = 1;
  for(int i = 0; i < m; i++) {
    for(int j = 0; j <= n; j++) {
      for(int k = j+1; k <= n; k++) dp[i+1][k]+=dp[i][j]*f(n-j,k-j);
    }
  }
  vector<vector<mint>> dp2(m+2,vector<mint>(m+2,0));
  dp2[0][0] = 1;
  vector<vector<mint>> po(m+2,vector<mint>(m+2,1));
  for(int i = 1; i <= m+1; i++) {
    for(int j = 1; j <= m+1; j++) po[i][j] = po[i][j-1]*i;
  }
  for(int i = 0; i <= m; i++) {
    for(int j = 0; j <= i; j++) {
      for(int k = i+1; k <= m+1; k++) {
        int d = min(s,k)-i;
        if(d < 0) d = 0;
        dp2[k][j+1]+=dp2[i][j]*po[k][d];
      }
    }
  }
  for(int i = 1; i <= m; i++) ans+=dp2[m+1][i]*dp[m-(i-1)][n];
  cout << ans.val() << endl;
}