#include <iostream>

using namespace std;

int n, m, k;
const int mod = 998244353; 
int dfs(int dep, int le) {
    if (le < 0) return 0;
    if (dep == k + 1) {
        if (le != 0) return 0;
        return 1;
    }
    if (le == 0) return 0;
    int res = 0;
    for (int i = 1; i <= le; i++) {
        if (le % m == 0) continue;
        res += dfs(dep + 1, le - i);
        res %= mod;
    }
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m >> k;
    cout << dfs(1, n) << endl;
    return 0;
}