import std;

void main () {
    int N, M, K; readln.read(N, M, K);

    solve(N, M, K);
}

void solve (int N, int M, int K) {
    const long MOD = 998244353;
    auto dp = new long[][](M + 1, 1 << N);
    // dp[i][j] := 先頭i列が条件を満たし、最新列のランプがjである場合の数

    foreach (j; 0..(1 << N)) {
        dp[1][j] = 1;
    }

    foreach (i; 1..M) {
        foreach (j; 0..(1 << N)) {
            foreach (k; 0..(1 << N)) {
                int count = 0;
                foreach (l; 0..N) if (0 < (j & (1 << l)) && 0 < (k & (1 << l))) count++;
                if (K <= count) {
                    dp[i + 1][k] += dp[i][j];
                    dp[i + 1][k] %= MOD;
                }
            }
        }
    }

    long ans = 0;
    foreach (i; 0..(1 << N)) {
        ans += dp[M][i];
        ans %= MOD;
    }

    writeln(ans);
}

void read (T...) (string S, ref T args) {
    import std.conv : to;
    import std.array : split;
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}