N,K=map(int,input().split())
ans=0
mod=998244353
A=[int(a) for a in bin(N)[2:]][::-1]
M=len(A)
a=0
t=1
for i in range(M+K):
	if i<K:
		if i<M:
			a^=A[i]
	elif i<M:
		a^=A[i]^A[i-K]
	else:
		a^=A[i-K]
	ans+=a*t
	ans%=mod
	t*=2
	t%=mod
print(ans)