#include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

ll n, m, k;
mint c[20][20];
void solve() {
  cin >> n >> m >> k;
  c[0][0] = 1;
  rep(i, 10) rep(j, i + 1) {
    c[i + 1][j] += c[i][j];
    c[i + 1][j + 1] += c[i][j];
  }
  vector<mint> dp(n + 1, 0);
  rep(i, n + 1) dp[i] = c[n][i];
  for (ll j = 1; j < m; j++) {
    vector<mint> p(n + 1, 0);
    swap(dp, p);
    for (ll pi = k; pi <= n; pi++) {
      for (ll ni = k; ni <= n; ni++) {
        for (ll si = min(pi, ni); si >= k; si--) {
          dp[ni] += p[pi] * c[pi][si] * c[n - pi][ni - si];
        }
      }
    }
  }
  mint ans = 0;
  rep(i, n + 1) ans += dp[i];
  cout << ans.val() << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}