// Template #include #define rep_override(x, y, z, name, ...) name #define rep2(i, n) for (int i = 0; i < (n); ++i) #define rep3(i, l, r) for (int i = (l); i < (r); ++i) #define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__) #define per(i, n) for (int i = (n) - 1; i >= 0; --i) #define all(x) (x).begin(), (x).end() using namespace std; using ll = long long; constexpr int inf = 1001001001; constexpr ll INF = 3003003003003003003; template inline bool chmin(T& x, const T& y) {if (x > y) {x = y; return 1;} return 0;} template inline bool chmax(T& x, const T& y) {if (x < y) {x = y; return 1;} return 0;} struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset; // Mod-Int constexpr int MOD = 998244353; struct ModInt { ll val; ModInt() = default; ModInt(ll x) : val(x % MOD + (x < 0 ? MOD : 0)) {} ModInt &operator+= (const ModInt &x) {if ((val += x.val) >= MOD) val -= MOD; return *this;} ModInt &operator-= (const ModInt &x) {if ((val -= x.val) < 0) val += MOD; return *this;} ModInt &operator*= (const ModInt &x) {(val *= x.val) %= MOD; return *this;} ModInt operator+ (const ModInt &x) const {return ModInt(*this) += x;} ModInt operator- (const ModInt &x) const {return ModInt(*this) -= x;} ModInt operator* (const ModInt &x) const {return ModInt(*this) *= x;} ModInt pow(ll t) const { if (!t) return ModInt(1); ModInt m = pow(t / 2); m *= m; if (t & 1) m *= *this; return m; } ModInt inv() const {return pow(MOD - 2);} ModInt &operator/= (const ModInt &x) {return *this *= x.inv();} ModInt operator/ (const ModInt &x) const {return ModInt(*this) /= x;} friend istream &operator>> (istream &is, ModInt &x) {is >> x.val; return is;} friend ostream &operator<< (ostream &os, const ModInt &x) {os << x.val; return os;} }; // Main int main() { ll n, l; cin >> n >> l; cout << ModInt(2).pow((n + l - 1) / l) - ModInt(1) << "\n"; return 0; }