x, K = map(int, input().split())

if K > 10:
	exit()

cnt = [0] * (K + 1)
for i in range(1 << (2 * K)):
	if bin(i).count('1') == K:
		now = 0
		mx = 0
		ok = True
		for j in range(2 * K):
			if i & (1 << j):
				now += 1
			else:
				now -= 1
			if now < 0:
				ok = False
			mx = max(mx, now)
		if ok:
			cnt[mx] += 1

mod = 998244353
s = sum(i * cnt[i] for i in range(K + 1))
print(s * pow(x * (100 - x), K, mod) * pow(100, mod - 1 - 2 * K, mod) % mod)