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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 998244353
using ll = long long int;

int main() {
  int N, M, K;
  cin >> N >> M >> K;
  auto count_bit = [&](int x, int b) {
    int rtn = 0;
    rep(i, b)
      if ((x>>i) & 1)
	rtn++;
    return rtn;
  };
  vector<vector<int>> dp(M, vector<int> (1<<N, 0));
  rep(j1, 1<<N) dp[0][j1] = 1;
  rep(i, M-1) {
    rep(j, 1<<N) {
      rep(j1, 1<<N) {
	if (count_bit(j & j1, N) >= K) {
	  dp[i+1][j1] = (dp[i+1][j1] + dp[i][j]) % MOD;
	}
      }
    }
  }
  int ans = 0;
  rep(i, 1<<N)
    ans = (ans + dp[M-1][i]) % MOD;
  cout << ans << endl;
  return 0;
}