CNTBULLS

#include <iostream>
#include <algorithm>
#include <numeric>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <climits>
using namespace std;
const int mod = 2111992, N = 1e5;
int dp[N+1], n, k;
void read()
{
   cin >> n >> k;
}
void solve()
{
   dp[0] = 1;
   for (int i = 1; i <= k; ++ i)
   {
       dp[i] = (dp[i-1]  +1) % mod;
   }
   for (int i = k + 1; i <= n; ++ i)
   {
       dp[i] = (dp[i-k-1] + dp[i - 1]) % mod;
   }
   cout << dp[n];
}
int main()
{
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   read();
   solve();
}