#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i=0;i<n;i++)
#define loop(i,m,n) for(long long i=m;i<=n;i++)
#define ll long long
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define mod 998244353LL

// 行列の掛け算
vvl multiply(const vvl& A, const vvl& B, ll m) {
    vvl C(m, vl(m, 0));
    rep(i, m) {
        rep(j, m) {
            rep(k, m) {
                C[i][j] += A[i][k] * B[k][j];
                C[i][j] %= mod;
            }
        }
    }
    return C;
}

// 行列累乗
vvl matrixPower(vvl A, ll n, ll m) {
    vvl result(m, vl(m, 0));
    rep(i, m) result[i][i] = 1; // 単位行列
    while (n > 0) {
        if (n % 2 == 1) {
            result = multiply(result, A, m);
        }
        A = multiply(A, A, m);
        n /= 2;
    }
    return result;
}

int main() {
    ll n, m, k;
    cin >> n >> m >> k;

    // 遷移行列の構築
    vvl T(m, vl(m, 0));
    loop(i, 1, m) {
        loop(j, 1, m) {
            if (abs(i - j) <= k) {
                T[i - 1][j - 1] = 1;
            }
        }
    }

    // T^n を計算
    T = matrixPower(T, n - 1, m);

    // 初期状態ベクトル
    vl ans(m, 1);

    // 結果計算
    ll sum = 0;
    rep(i, m) {
        rep(j, m) {
            sum += T[i][j] * ans[j];
            sum %= mod;
        }
    }

    cout << sum << endl;

    return 0;
}