#include using namespace std; #define int long long templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> n >> d >> k; dp[0][0] = 1; for(int i = 1;i <= n;i++){ int rui[100010] = {}; for(int j = 0;j <= k;j++){ rui[j+1] = (rui[j] + dp[i-1][j]) % MOD; } dp[i][0] = 0; for(int j = 1;j <= k;j++){ dp[i][j] = (MOD + rui[j] - rui[max(0ll, j-d)]) % MOD; } } cout << dp[n][k] << endl; return 0; }