#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

int popcount(int x){
    int c = 0;
    while(x){
        x &= x - 1;
        ++c;
    }
    return c;
}

int main() {
    int N, M, K;
    cin >> N >> M >> K;

    vector<int> dp(1 << N, 1);
    int NN = 1 << N;
    int mod = 998244353;
    for(int i = 0; i < M-1; i++){
        vector<int> dpn(1 << N, 0);
        for(int b = 0; b < NN; b++){
            for(int c = 0; c < NN; c++){
                if(popcount(c & b) >= K){
                    dpn[c] += dp[b];
                }
                dpn[c] %= mod;
            }
        }
        dp = dpn;
    }
    int sum = 0;
    for(int i = 0; i < NN; i++){
        sum += dp[i];
        sum %= mod;
    }
    cout << sum << endl;
    return 0;
}