#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using graph = vector<vector<int>>;

const ll mod = 998244353;
const int INF = 1001001001;

ll modpow(ll a, ll p){
    ll ret = 1;
    while(p){
        if(p & 1) ret = ret * a % mod;
        a = a * a % mod;
        p >>= 1;
    }
    return ret;
}

int main(){
    ll n, k; cin >> n >> k;
    ll ans = 1;
    if(n <= k){
        cout << ans << endl;
        return 0;
    }
    else{
        ll tmp = (n + k - 1) / k;
        cout << modpow(2, tmp) - 1 << endl;
    }
}