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

const long long mod = 998244353;

template< typename T >
vector< pair< pair< T, T >, T > > quotient_range(T N) {
  T M;
  vector< pair< pair< T, T >, T > > ret;
  for(M = 1; M * M <= N; M++) {
    ret.emplace_back(make_pair(M, M), N / M);
  }
  for(T i = M; i >= 1; i--) {
    T L = N / (i + 1) + 1;
    T R = N / i;
    if(L <= R && ret.back().first.second < L) ret.emplace_back(make_pair(L, R), N / L);
  }
  return ret;
}

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    auto range = quotient_range(M);
    vector dp(N, vector(size(range), 0LL));
    for(int i = 0; i < size(range); i++) {
        dp[0][i] = (range[i].first.second - range[i].first.first + 1);
    }
    for(int i = 0; i+1 < N; i++) {
        for(int j = 0; j < size(range); j++) {
            for(int nj = 0; nj < size(range); nj++) {
                if(K < abs(range[j].second-range[nj].second)) continue;
                dp[i+1][nj] = (dp[i+1][nj] + ((range[nj].first.second - range[nj].first.first + 1) * dp[i][j]) % mod) % mod;
            }
        }
    }
    long long ans(0LL);
    for(int i = 0; i < size(range); i++) {
        ans = (ans + dp[N-1][i]) % mod;
    }
    cout << ans << endl;
    return 0;
}