#include <bits/stdc++.h>
using namespace std;

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y

#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'017LL;

constexpr i64 MOD = 998244353LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

#define M5 100007
#define M9 1000000000

#define F first
#define S second

// util {{{
#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)

#define all(x) (x).begin(), (x).end()
#define ll long long int
#define VI vector<ll>
#define VVI vector<VI>

#define ISD true
#define debug(x) \
    if (ISD)     \
    cout << #x << ": " << x << endl

template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

#define mat vector<vector<ll>>

/// 行列積
mat mat_mul(mat &a, mat &b)
{
    mat res(a.size(), vector<ll>(b[0].size()));
    for (int i = 0; i < a.size(); i++)
    {
        for (int j = 0; j < b[0].size(); j++)
        {
            for (int k = 0; k < b.size(); k++)
            {
                (res[i][j] += a[i][k] * b[k][j]) %= MOD;
            }
        }
    }
    return res;
}

/// 行列累乗
mat mat_pow(mat a, long long n)
{
    mat res(a.size(), vector<ll>(a.size()));
    // 単位行列で初期化
    for (int i = 0; i < a.size(); i++)
        res[i][i] = 1;
    // 繰り返し二乗法
    while (n > 0)
    {
        if (n & 1)
            res = mat_mul(a, res);
        a = mat_mul(a, a);
        n >>= 1;
    }
    return res;
}

int main()
{
    ll N, M, K;
    cin >> N >> M >> K;
    mat V(M, vector<ll>(M));
    REP(i, M)
    {
        REP(j, M)
        {
            if (abs(M / (i + 1) - M / (j + 1)) <= K)
            {
                V[i][j] = 1;
            }
            else
            {
                V[i][j] = 0;
            }
        }
    }
    mat x = mat_pow(V, N - 1);
    ll ans = 0;
    REP(i, M)
    {
        REP(j, M)
        {
            ans += x[i][j];
            ans %= MOD;
        }
    }
    cout << ans << endl;
}