#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 
const long long mod = 998244353;
long long keisan(long long m, long long n) {
  long long a = 1;
  //cout<<"koko"<<m<<" "<<n<<endl;
  while (n > 0) {
    if (n % 2) {
      a *= m;
	  a%=mod;
      n-=1;
    } else {
      m *= m;
	  m%=mod;
      n /= 2;
    }
  }
  return a;
}
int main(){
	ll n,l;
	ll kotae=0;
	cin>>n>>l;
	if(n<=l){
		cout<<1<<endl;
		return 0;
	}
	if(l==1){
		kotae=keisan(2,n);
		cout<<kotae-1<<endl;
		return 0;
	}
	long long x;
	x=n/l;
	if(n%l!=0)x++;
	kotae=keisan(2,x);
	cout<<kotae-1<<endl;
	return 0;
}