from itertools import product


def main():
    N, M, K = map(int, input().split())
    MOD = 998244353
    if M == 1:
        print(pow(2, N, MOD))
        return

    dp_table = [[0 for _ in range(1 << N)] for _ in range(2)]
    dp_table[0] = [1 for _ in range(1 << N)]

    for _ in range(M - 1):
        for prev_light, cur_light in product(range(1 << N), repeat=2):
            if (prev_light & cur_light).bit_count() < K:
                continue
            dp_table[1][cur_light] += dp_table[0][prev_light]
            dp_table[1][cur_light] %= MOD
        dp_table[0] = dp_table[1]
        dp_table[1] = [0 for _ in range(1 << N)]

    ans = 0
    for elm in dp_table[0]:
        ans += elm
        ans %= MOD
    print(ans)


if __name__ == "__main__":
    main()