import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n, m = LI()
# pDB(bin(n)[2:])

if n==0:
    print(0)
    exit()

bb = []
while n:
    bb.append(n & 1)
    n >>= 1
d = len(bb)

if m-d+1 >= 0:
    # pDB(bb)
    cs = []
    s = 0
    for b in bb:
        s ^= b
        cs.append(s)

    ans = 0
    if cs[-1]:
        ans = pow(2, m-d+1, md)-1
        ans = ans*pow(2, d-1, md)%md

    two = 1
    for b in cs[:-1]:
        ans += two*b
        ans %= md
        two = two*2%md

    cs = []
    s = 0
    for b in bb[::-1]:
        s ^= b
        cs.append(s)

    # pDB(cs)
    cs.pop()
    two = pow(2, m, md)
    for b in cs[::-1]:
        ans += two*b
        ans %= md
        two = two*2%md

else:
    ans = 0
    two = 1
    x = 0
    for i in range(d+m-1):
        if i < len(bb): x ^= bb[i]
        if i-m >= 0: x ^= bb[i-m]
        ans += x*two
        ans %= md
        two = two*2%md

print(ans)