#include <bits/stdc++.h>
using namespace std;
using lint = long long;
int main() {
  lint n, m, K;
  cin >> n >> m >> K;
  vector dp(m+1, vector<lint>((1<<n), 0));
  const lint MOD = 998244353;
  // i列目まで見て、i列目がjのときの場合数
  
  dp[0][0] = 1;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < (1<<n); j++) {
      for (int k = 0; k < (1<<n); k++) {
        // jとkの組み合わせok?
        int cnt = 0;
        for (int l = 0; l < n; l++) {
          if ((1<<l)&j&k) cnt++;
        }
        if (i == 0 || cnt >= K) {
          // 遷移できる
          dp[i+1][k]+=dp[i][j];
          dp[i+1][k] %= MOD;
        }
      }
    }
  }
  lint ans = 0;
  for (int i = 0; i < (1<<n); i++) {
    ans += dp[m][i];
  }
  cout << ans%MOD << endl;
  return 0;
  for (auto x : dp) {
    for (auto y : x) cout << y << " ";
    cout << endl;
  }
}