mod=998244353
n,m=map(int,input().split())
s=bin(n)[2:]

if m<100:
  ans=0
  for i in range(m):
    ans^=n<<i
  print(ans%mod)
  exit()

ans=0
ns=len(s)
for i in range(40):
  cnt=0
  for j in range(max(0,ns-i-1),ns):
    cnt+=(s[j]=='1')
  if cnt%2==1:
    ans+=pow(2,i,mod)

for i in range(40):
  cnt=0
  for j in range(min(ns,i+1)):
    cnt+=(s[j]=='1')
  if cnt%2==1:
    ans+=pow(2,ns+m-i-2,mod)

if s.count('1')%2==1:
  ans+=pow(2,ns+m-41,mod)-pow(2,40,mod)
  ans%=mod

print(ans%mod)