You are given two positive integers N and K. How many multisets of rational numbers satisfy all of the following conditions?
 - The multiset has exactly N elements and the sum of them is equal to K.
 - Each element of the multiset is one of 1, \frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \dots. In other words, each element can be represented as \frac{1}{2^i}\ (i = 0,1,\dots).
The answer may be large, so print it modulo 998244353.

-----Constraints-----
 - 1 \leq K \leq N \leq 3000
 - All values in input are integers.

-----Input-----
Input is given from Standard Input in the following format:
N K

-----Output-----
Print the number of multisets of rational numbers that satisfy all of the given conditions modulo 998244353.

-----Sample Input-----
4 2

-----Sample Output-----
2

The following two multisets satisfy all of the given conditions:
 - {1, \frac{1}{2}, \frac{1}{4}, \frac{1}{4}}
 - {\frac{1}{2}, \frac{1}{2}, \frac{1}{2}, \frac{1}{2}}

Difficulty: HARD

Solutions:
(n, k) = map(int, input().split())
mod = 998244353
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n + 1):
	for j in range(i, -1, -1):
		dp[j] = dp[j - 1]
		if 2 * j <= i:
			dp[j] += dp[2 * j]
		dp[j] %= mod
print(dp[k])


(N, K) = map(int, input().split())
MOD = 998244353
dp = [[0] * (2 * N + 1) for _ in range(N + 1)]
dp[0][0] = 1
for i in range(1, N + 1):
	for j in range(i, 0, -1):
		dp[i][j] = (dp[i - 1][j - 1] + dp[i][2 * j]) % MOD
print(dp[N][K])


(n, k) = list(map(int, input().split()))
MOD = 998244353
dp = [1]
for i in range(1, n + 1):
	ndp = [0] * (i + 1)
	for j in range(i, 0, -1):
		tmp = dp[j - 1]
		if j * 2 <= i:
			tmp += ndp[j * 2]
		ndp[j] = tmp % MOD
	dp = ndp
print(dp[k])


MOD = 998244353
(n, k) = map(int, input().split())
dp = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0] = 1
for i in range(1, n + 1):
	for j in range(i, 0, -1):
		dp[i][j] = dp[i - 1][j - 1]
		try:
			dp[i][j] += dp[i][j * 2]
		except IndexError:
			pass
		dp[i][j] %= MOD
print(dp[n][k])


import sys
sys.setrecursionlimit(10 ** 6)
readline = sys.stdin.readline
INF = 1 << 60

def read_int():
	return int(readline())

def read_int_n():
	return list(map(int, readline().split()))

def read_float():
	return float(readline())

def read_float_n():
	return list(map(float, readline().split()))

def read_str():
	return readline().strip()

def read_str_n():
	return readline().strip().split()

def ep(*args):
	print(*args, file=sys.stderr)

def mt(f):
	import time

	def wrap(*args, **kwargs):
		s = time.perf_counter()
		ret = f(*args, **kwargs)
		e = time.perf_counter()
		ep(e - s, 'sec')
		return ret
	return wrap

def gen_2d(n, m, fill=0):
	return [[fill] * m for _ in range(n)]

@mt
def slv(N, K):
	memo = gen_2d(N + 1, 2 * N + 1)
	memo[0][0] = 1
	M = 998244353
	for n in range(1, N + 1):
		for k in range(n, 0, -1):
			x = memo[n - 1][k - 1]
			x += memo[n][k * 2]
			x %= M
			memo[n][k] = x
	return memo[N][K]

def main():
	(N, K) = read_int_n()
	print(slv(N, K))

def __starting_point():
	main()
__starting_point()


import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
from functools import lru_cache
import copy
input = sys.stdin.readline
INF = float('inf')
mod = 10 ** 9 + 7
eps = 10 ** (-7)

def inp():
	return int(input())

def inpl():
	return list(map(int, input().split()))

def str_inp():
	return list(input()[:-1])
mod = 998244353
(n, k) = inpl()
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
	for j in range(1, i + 1)[::-1]:
		if i == j:
			dp[i][j] = 1
			continue
		a = dp[i - 1][j - 1]
		b = dp[i][2 * j] if 2 * j < n + 1 else 0
		dp[i][j] = (a + b) % mod
print(dp[n][k] % mod)


def solve():
	MOD = 998244353
	(N, K) = list(map(int, input().split()))
	N2 = N - N % 2
	dp = [[0] * (N + 1) for _ in range(N - K + 1)]
	accRevDp = [[0] * (N + 1) for _ in range(N - K + 1)]
	dp[0][K] = 1
	accRevDp[0] = [1] * (K + 1) + [0] * (N - K)
	for i in range(1, N - K + 1):
		j = min(N2, 2 * i)
		dp[i][j] = accRevDp[i][j] = accRevDp[i - j // 2][j // 2]
		for j in reversed(list(range(0, min(N2, 2 * i), 2))):
			dp[i][j] = accRevDp[i - j // 2][j // 2]
			accRevDp[i][j + 1] = accRevDp[i][j + 2]
			accRevDp[i][j] = (accRevDp[i][j + 1] + dp[i][j]) % MOD
	ans = sum(dp[N - K]) % MOD
	print(ans)
solve()


from itertools import combinations
P = 998244353
nn = 2002002
fa = [1] * (nn + 1)
fainv = [1] * (nn + 1)
for i in range(nn):
	fa[i + 1] = fa[i] * (i + 1) % P
dp = []
for _ in range(3001):
	dp.append([0] * 3001)
for i in range(3001):
	dp[i][i] = 1
for i in range(1, 3001):
	for j in reversed(range(1, i)):
		if 2 * j > 3000:
			dp[i][j] = dp[i - 1][j - 1]
		else:
			dp[i][j] = (dp[i - 1][j - 1] + dp[i][2 * j]) % P
(N, K) = [int(i) for i in input().split()]
print(dp[N][K])


(n, k) = map(int, input().split())
mod = 998244353
dp = [[0] * 6005 for _ in range(3001)]
dp[0][0] = 1
for i in range(1, 3001):
	for j in range(i, 0, -1):
		dp[i][j] = dp[i - 1][j - 1] + dp[i][2 * j]
		dp[i][j] %= mod
ans = dp[n][k]
print(ans)


(N, K) = map(int, input().split())
mat = [[0 for i in range(j + 1)] for j in range(N + 1)]

def tar(Num, Sum):
	if Num < Sum:
		return 0
	return mat[Num][Sum]
mat[1][1] = 1
MOD = 998244353
for i in range(2, N + 1):
	for j in range(1, i + 1)[::-1]:
		mat[i][j] = tar(i - 1, j - 1) + tar(i, 2 * j)
		mat[i][j] %= MOD
print(mat[N][K])


MOD = 998244353

def f(N, K):
	if K > N:
		return 0
	S0 = [1]
	for i in range(1, N + 1):
		S1 = [0] * (i + 1)
		for j in range(i, 0, -1):
			S1[j] = (S0[j - 1] + (S1[j * 2] if j * 2 <= i else 0)) % MOD
		S0 = S1
	return S0[K]
(N, K) = list(map(int, input().split()))
print(f(N, K))


def solve():
	MOD = 998244353
	(N, K) = list(map(int, input().split()))
	dp = [[0] * (N + 1) for _ in range(N + 1)]
	dp[0][0] = 1
	for num in range(1, N + 1):
		for sm in reversed(list(range(N + 1))):
			if num > 0 and sm > 0:
				dp[num][sm] += dp[num - 1][sm - 1]
			if 2 * sm <= N:
				dp[num][sm] += dp[num][2 * sm]
			dp[num][sm] %= MOD
	ans = dp[N][K]
	print(ans)
solve()


def MI():
	return list(map(int, input().split()))
(n, k) = MI()
mod = 998244353
if n < k:
	print(0)
	return
dp = [[0] * (2 * n + 1) for i in range(n + 1)]
dp[0][0] = 1
for i in range(1, n + 1):
	for j in range(i, 0, -1):
		dp[i][j] += dp[i][j * 2] + dp[i - 1][j - 1]
		dp[i][j] %= mod
print(dp[n][k])


import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000)

def I():
	return int(input())

def MI():
	return list(map(int, input().split()))

def LI():
	return list(map(int, input().split()))
mod = 998244353
(N, K) = MI()
if N == K:
	print(1)
	return
if K > N:
	print(0)
	return
M = max(N, K)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i in range(1, M + 1):
	dp[i][i] = 1
for i in range(1, N + 1):
	for j in range(i - 1, 0, -1):
		dp[i][j] = dp[i - 1][j - 1]
		if 2 * j <= M:
			dp[i][j] += dp[i][2 * j]
		dp[i][j] %= mod
print(dp[N][K])


(N, K) = list(map(int, input().split()))
mod = 998244353
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
	for j in range(i, -1, -1):
		dp[j] = dp[j - 1]
		if j * 2 <= i:
			dp[j] += dp[2 * j]
		dp[j] %= mod
print(dp[K])


import sys
import math
from collections import defaultdict

def input():
	return sys.stdin.readline().rstrip()

def main():
	(N, K) = list(map(int, input().split()))
	mod = 998244353
	dp = [0] * (N + 1)
	dp[0] = 1
	for i in range(1, N + 1):
		for j in range(i, -1, -1):
			dp[j] = dp[j - 1]
			if j * 2 <= N:
				dp[j] += dp[2 * j]
			dp[j] %= mod
	print(dp[K])

def __starting_point():
	main()
__starting_point()


(N, K) = list(map(int, input().split()))
C = 998244353
dp = [[0] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 1
for i in range(1, N + 1):
	for j in range(N, 0, -1):
		if j > i:
			continue
		dp[i][j] = dp[i - 1][j - 1]
		if 2 * j <= N:
			dp[i][j] = (dp[i][j] + dp[i][2 * j]) % C
print(dp[N][K])


(N, K) = list(map(int, input().split()))
Mod = 998244353
DP = [0] * (N + 1)
DP[0] = 1
for x in range(1, N + 1):
	(ODP, DP) = (DP, [0] * (N + 1))
	for k in range(N, -1, -1):
		DP[k] = ODP[k - 1]
		if 2 * k <= N:
			DP[k] += DP[2 * k]
			DP[k] %= Mod
print(DP[K])


(n, k) = map(int, input().split())
a = [[0] * (n + 1) for i in range(n + 1)]
for i in range(1, n + 1):
	for j in range(i, 0, -1):
		if i == j:
			a[i][j] = 1
		elif j > 0:
			a[i][j] = a[i - 1][j - 1]
			if i >= 2 * j:
				a[i][j] += a[i][2 * j]
				a[i][j] %= 998244353
print(a[n][k])


(N, K) = map(int, input().split())
MOD = 998244353
dp = [[0] * (N + 1) for _ in range(N + 1)]
dp[1][1] = 1

def get_dp(n, k):
	try:
		return dp[n][k]
	except:
		return 0
for n in range(2, N + 1):
	for k in range(n, -1, -1):
		dp[n][k] = get_dp(n - 1, k - 1) + get_dp(n, 2 * k)
		dp[n][k] %= MOD
print(dp[N][K])


import sys, math
import io, os
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
from itertools import permutations, combinations

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write(' '.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
sys.setrecursionlimit(100000)
INF = float('inf')
mod = 998244353
(n, k) = mdata()
dp = [[0] * (n + 1) for i in range(n + 1)]
dp[0][0] = 1
dp[1][1] = 1
dp1 = [0] * (2 * n + 1)
for i in range(2, n + 1):
	for j in range(i, 0, -1):
		dp[i][j] = (dp[i - 1][j - 1] + dp1[2 * j]) % mod
		dp1[j] = dp[i][j] % mod
out(dp[n][k])


(n, k) = map(int, input().split())
dp = [[0] * (2 * n + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(1, n + 1):
	for j in reversed(range(i + 1)):
		dp[i][j] = (dp[i - 1][j - 1] + dp[i][2 * j]) % 998244353
print(dp[n][k])


(N, K) = map(int, input().split())
dp = [[0] * n for n in range(1, N + 2)]
for n in range(N + 1):
	dp[n][n] = 1
	for k in reversed(range(1, n)):
		if 2 * k <= n:
			dp[n][k] = (dp[n - 1][k - 1] + dp[n][2 * k]) % 998244353
		else:
			dp[n][k] = dp[n - 1][k - 1]
	dp[n][0] = 0
print(dp[N][K])


import bisect, collections, copy, heapq, itertools, math, string
import sys

def I():
	return int(sys.stdin.readline().rstrip())

def MI():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def LI():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def S():
	return sys.stdin.readline().rstrip()

def LS():
	return list(sys.stdin.readline().rstrip().split())
from collections import deque, defaultdict, Counter
import heapq
from functools import reduce
from itertools import permutations
import math
import bisect

def main():
	mod = 998244353

	def comp(x, y):
		if x < y:
			return 0
		return dp[x][y]
	(N, K) = MI()
	dp = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
	dp[0][0] = 1
	dp[0][1] = 0
	dp[1][0] = 0
	dp[1][1] = 1
	for i in range(2, N + 1):
		for j in range(N, 0, -1):
			dp[i][j] = comp(i - 1, j - 1) + comp(i, 2 * j)
			dp[i][j] %= mod
	print(dp[N][K])

def __starting_point():
	main()
__starting_point()


MOD = 998244353

def solve(n, k):
	dp = [[0] * (n + 1) for _ in range(n + 1)]
	dp[0][0] = 1
	for i in range(1, n + 1):
		for j in range(i, -1, -1):
			if 2 * j <= i:
				dp[i][j] = (dp[i - 1][j - 1] + dp[i][2 * j]) % MOD
			else:
				dp[i][j] = dp[i - 1][j - 1]
	return dp[n][k]

def main():
	(n, k) = list(map(int, input().split()))
	res = solve(n, k)
	print(res)

def test():
	assert solve(4, 2) == 2
	assert solve(2525, 425) == 687232272

def __starting_point():
	test()
	main()
__starting_point()


def main():
	mod = 998244353
	(n, k) = list(map(int, input().split()))
	dp = [[0] * (n + 1) for _ in [0] * (n + 1)]
	dp[0][0] = 1
	for i in range(1, n + 1):
		for j in range(n, 0, -1):
			if 2 * j <= n:
				dp[i][j] = (dp[i - 1][j - 1] + dp[i][2 * j]) % mod
			else:
				dp[i][j] = dp[i - 1][j - 1]
	print(dp[n][k])
main()


import sys

def input():
	return sys.stdin.readline().strip()

def main():
	mod = 998244353
	(N, K) = list(map(int, input().split()))
	dp = [[0] * (N * 2 + 5) for _ in range(N + 1)]
	dp[0][0] = 1
	dp[1][1] = 1
	for n in range(1, N + 1):
		for k in range(n, -1, -1):
			dp[n][k] = dp[n - 1][k - 1] + dp[n][k * 2]
			dp[n][k] %= mod
	print(dp[N][K])

def __starting_point():
	main()
__starting_point()


def resolve():
	mod = 998244353
	(N, K) = list(map(int, input().split(' ')))
	dp = [[0] * (N + 1) for _ in range(N + 1)]
	for n in range(N + 1):
		dp[n][n] = 1
	for n in range(1, N + 1):
		for k in range(n, 0, -1):
			result = dp[n - 1][k - 1]
			if 2 * k <= n:
				result += dp[n][2 * k]
			dp[n][k] = result % mod if result > mod else result
	print(dp[N][K])

def __starting_point():
	resolve()
__starting_point()


def ans(n, k):
	dp = [[0 for x in range(6001)] for y in range(6001)]
	dp[1][1] = 1
	for i in range(2, n + 1):
		for j in range(3000, 0, -1):
			dp[i][j] = (dp[i - 1][j - 1] + dp[i][2 * j]) % 998244353
	print(dp[n][k])
(n, k) = (int(x) for x in input().split())
ans(n, k)


printn = lambda x: print(x, end='')
inn = lambda : int(input())
inl = lambda : list(map(int, input().split()))
inm = lambda : map(int, input().split())
ins = lambda : input().strip()
DBG = True
BIG = 10 ** 18
R = 998244353

def ddprint(x):
	if DBG:
		print(x)
(n, k) = inm()
dp = [[0] * (n + 1) for i in range(n + 1)]
dp[0][0] = 1
for i in range(1, n + 1):
	for j in range(i, 0, -1):
		dp[i][j] = (dp[i - 1][j - 1] + (dp[i][2 * j] if 2 * j <= i else 0)) % R
print(dp[n][k])