#include using namespace std; #include using namespace atcoder; // input and output of modint istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } template istream &operator>>(istream &is, static_modint &a) { long long v; is >> v; a = v; return is; } template ostream &operator<<(ostream &os, const static_modint &a) { return os << a.val(); } template istream &operator>>(istream &is, dynamic_modint &a) { long long v; is >> v; a = v; return is; } template ostream &operator<<(ostream &os, const dynamic_modint &a) { return os << a.val(); } #define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i) #define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i) #define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #ifdef LOCAL void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); } #define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template using V = vector; using ll = long long; using ld = long double; using Vi = V; using VVi = V; using Vl = V; using VVl = V; using Vd = V; using VVd = V; using Vb = V; using VVb = V; template using priority_queue_rev = priority_queue, greater>; template vector make_vec(size_t n, T a) { return vector(n, a); } template auto make_vec(size_t n, Ts... ts) { return vector(n, make_vec(ts...)); } template inline int sz(const T &x) { return size(x); } template inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template istream &operator>>(istream &is, array &v) { for (auto &e : v) is >> e; return is; } template ostream &operator<<(ostream &os, const array &v) { for (auto &e : v) os << e << ' '; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &e : v) is >> e; return is; } template ostream &operator<<(ostream &os, const vector &v) { for (auto &e : v) os << e << ' '; return os; } template inline void deduplicate(vector &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); } template inline int count_between(const vector &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r) inline ll cDiv(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y) inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x)) inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x)) inline int popcount(const ll x) { return __builtin_popcountll(x); } inline void fail() { cout << -1 << '\n'; exit(0); } struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; // const int INF = (1<<30) - 1; // const ll INFll = (1ll<<60) - 1; // const ld EPS = 1e-10; // const ld PI = acos(-1.0); using mint = modint998244353; // using mint = modint1000000007; // using mint = modint; // using Vm = V; using VVm = V; template struct Factorial { int MAX; vector fac, finv; Factorial(int m = 0) : MAX(m), fac(m+1, 1), finv(m+1, 1) { rep(i, 2, MAX+1) fac[i] = fac[i-1] * i; finv[MAX] /= fac[MAX]; drep(i, MAX+1, 3) finv[i-1] = finv[i] * i; } T binom(int n, int k) { if (k < 0 || n < k) return 0; return fac[n] * finv[k] * finv[n-k]; } T perm(int n, int k) { if (k < 0 || n < k) return 0; return fac[n] * finv[n-k]; } }; Factorial fc; void solve() { // ll solve() { int n, m, k; cin >> n >> m >> k; fc = Factorial(n+2); int p = n-m+1; mint ans = 0; rep(i, m+1) { int j = m - k*i; if (j < 0) break; mint res = fc.binom(p, i) * fc.binom(p+j-1, j); if (i&1) ans -= res; else ans += res; } ans = fc.binom(n, m) - ans; cout << ans << '\n'; return; } int main() { solve(); // cout << solve() << '\n'; }