#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N >> K; dp[0]=1; for(i=1;i<=N;i++){ dp[i]+=dp[i-1]; dp[i]%=MOD; if(i-K>=0) dp[i]+=dp[i-K]; dp[i]%=MOD; } cout << dp[N] << endl; return 0; }