#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
const vector<int> dx = {0, 0, 1, -1};
const vector<int> dy = {1, -1, 0, 0};
#define vec vector
#define int long long
#define double long double
#define ll long long
#define pii pair<int,int>
#define pq priority_queue
#define all(V) begin(V),end(V)
#define tple tuple<int,int,int>
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
#define nexper(Z) next_permutation(all(Z))
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, x, n) for (int i = x; i < (int)(n); i++)
#define rex(i, n) for (int i = 1; i <= (int)(n); i++)
#define rey(i, x, n) for (int i = x; i <= (int)(n); i++)
#define cleout(i) cout << fixed << setprecision(i)
struct Point {long long x, y;};
Point operator+(const Point& a1, const Point& a2) {return Point{ a1.x + a2.x, a1.y + a2.y };}
Point operator-(const Point& a1, const Point& a2) {return Point{ a1.x - a2.x, a1.y - a2.y };}
bool operator<(const Point& a1, const Point& a2) {if (a1.x < a2.x) return true;if (a1.x > a2.x) return false;if (a1.y < a2.y) return true;return false;}

using mint=modint998244353;
using S = long long;
using F = long long;

const S INF = 8e18;

S op(S a, S b){ return std::max(a, b)%998244353; }
S e(){ return -INF; }
S mapping(F f, S x){ return (f+x)%998244353; }
F composition(F f, F g){ return (f+g)%998244353; }
F id(){ return 0; }

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n,k;cin>>n>>k;
    map<int,mint> dp;
    dp[0]=1;
    if(k>n){
      cout<<1;return 0;
    }
    mint ans=1;n-k+1;
    mint pre=n-k+1;
    rep(i,n){
      if(dp.size()==0){break;}
      map<int,mint> ndp;
      for(auto x:dp){
        for(int j=x.first+k;j<=n;j++){
          ndp[j]+=dp[x.first];ans+=dp[x.first];
        }
      }
      swap(ndp,dp);
    }
    cout<<ans.val();
    
    return 0;

}