#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <numeric>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

ll modpow(ll a, ll b, ll m = mod) {
  ll r = 1;
  while (b > 0) {
    if (b & 1) r = (r * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return r;
}

ll modinv(ll x, ll m = mod) {
  ll b = m;
  ll u = 1;
  ll v = 0;
  ll tmp;
  while (b) {
    ll t = x / b;
    x -= t * b;
    tmp = x;
    x = b;
    b = tmp;
    u -= t * v;
    tmp = u;
    u = v;
    v = tmp;
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}

ll modcomb(ll n, ll r, ll m = mod) {
  if (r < 0 || r > n) return 0;
  r = min(r, n - r);
  ll num = 1;
  ll denom = 1;
  for (ll i = 0; i < r; i++) {
    num = (num * (n - i)) % m;
    denom = (denom * (i + 1)) % m;
  }
  return (num * modinv(denom, m)) % m;
}

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

  ll n, m, k;
  cin >> n >> m >> k;

  vector<vector<ll>> dp(m, vector<ll>(1 << n));
  for (int j = 0; j < (1 << n); j++) dp[0][j] = 1;
  for (int i = 1; i < m; i++) {
    for (int j = 0; j < (1 << n); j++) {
      for (int l = 0; l < (1 << n); l++) {
        if (__builtin_popcount(j & l) >= k) {
          dp[i][l] = (dp[i][l] + dp[i-1][j]) % mod;
        }
      }
    }
  }

  ll ans = 0;
  for (int j = 0; j < (1 << n); j++) ans = (ans + dp[m-1][j]) % mod;

  cout << ans << endl;

  return 0;
}