/* -*- coding: utf-8 -*-
 *
 * 1184.cc:  No.1184 Hà Nội - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MOD = 998244353;

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  ll n, l;
  scanf("%lld%lld", &n, &l);

  int m = ((n + l - 1) / l) % MOD;
  int x = (powmod(2, m) + MOD - 1) % MOD;
  printf("%d\n", x);
  return 0;
}