#include <bits/stdc++.h>
#include <atcoder/modint>
// #include <atcoder/lazysegtree>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for(int i = (s); i < (int)(n); i++)
#define printYN(check) cout << ((check)? "Yes" : "No") << endl
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define NUM 998244353
#define IMAX INT_MAX
#define LMAX LONG_MAX
using namespace std;
using namespace atcoder;
// using mint = modint;
using mint = modint998244353;
// using mint = modint1000000007;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using tii = tuple<int, int, int>;
using mii = map<int, int>;
// using Graph = vvi;
// Graph graph(n);
// vi dx = {-1, 0, 1, -1, 1, -1,  0, 1};
// vi dy = { 1, 1, 1,  0, 0, -1, -1,-1};

template<typename T> bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }

// snippet -> {UnionFind, dfs_reculsive, dfs_stack, is_prime, mypow, print_array, 
//             bfs_queue, digsum, binary_search, gcd, Dijkstra, bitsearch,
//             next_combination, binomial}
// -------------------------------------------------------------------------

using  vmint = vector<mint>;
using vvmint = vector<vmint>;

int mypow(int x, int n) {
    int ret = 1;
    while (n > 0) {
        if (n & 1) ret *= x;  // n の最下位bitが 1 ならば x^(2^i) をかける
        x *= x;
        n >>= 1;  // n を1bit 左にずらす
    }
    return ret;
}

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    int s = mypow(2, n);
    vvmint dp(m, vmint(s, 0));
    rep(j, s) {
        bitset<5> b(j);
        if(b.count() >= k) dp[0][j] = 1;
    }
    rep(i, m-1) {
        rep(j, s) {
            bitset<5> b1(j);
            if(b1.count() < k) continue;
            rep(h, s) {
                bitset<5> b2(h);
                if(b2.count() < k) continue;
                int cnt = 0;
                rep(l, n) {
                    if(b1.test(l) && b2.test(l)) cnt++;
                }
                if(cnt >= k) {
                    dp[i+1][h] += dp[i][j];
                }
            }
        }
    }
    mint ans = 0;
    rep(i, s) ans += dp[m-1][i];
    cout << ans.val() << endl;
    return 0;
}