#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long 
long long mod=998244353;
map<long long,long long> b;
long long keisan(long long a){
	if(a==1)return b[1]=1LL;
	if(b[a]!=0)return b[a];
	b[a]=2*keisan(a-1)+1LL;
	b[a]%=mod;
	return b[a];
}
int main(){
	ll n,l,kotae=0;
	cin>>n>>l;
	if(n<=l){
		cout<<1<<endl;
		return 0;
	}
	if(l==1){
		kotae=keisan(n);
		cout<<kotae<<endl;
		return 0;
	}
	long long x;
	x=n/l;
	if(n%l!=0)x++;
	kotae=keisan(x);
	cout<<kotae<<endl;
	return 0;
}