#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using i8 = int8_t;
using i32 = int;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;
using ll = long long;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res *= x;
    x *= x;
    n >>= 1;
  }
  return res;
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}

const i64 inf = 1ll << 60;

void _main() {
  i64 n, m, k;
  cin >> n >> m >> k;
  vector<vector<i64>> dp(m, vector<i64>(n + 1, 0));
  vector<vector<i64>> c(n + 1, vector<i64>(n + 1, 0));
  for (i64 i = 0; i <= n; i++) {
    for (i64 j = 0; j <= n; j++) {
      if (i < j) {
        c[i][j] = 0;
      } else {
        c[i][j] = 1;
        for (i64 a = i; a > 0; a--) {
          c[i][j] *= a;
        }
        for (i64 a = j; a > 0; a--) {
          c[i][j] /= a;
        }
        for (i64 a = i - j; a > 0; a--) {
          c[i][j] /= a;
        }
      }
    }
  }
  for (i64 i = k; i <= n; i++) {
    dp[0][i] = c[n][i];
  }
  for (i64 i = 1; i < m; i++) {
    for (i64 j = k; j <= n; j++) {
      for (i64 a = k; a <= n; a++) {
        for (i64 b = k; b <= n; b++) {
          if (min(j, a) < b) {
            continue;
          }
          dp[i][j] += dp[i - 1][a] * c[a][b] * c[n - a][j - b];
          dp[i][j] %= 998244353;
        }
      }
    }
  }
  i64 ans = 0;
  for (i64 i = 0; i <= n; i++) {
    ans = (ans + dp[m - 1][i]) % 998244353;
  }
  cout << ans << "\n";
}