mod = 998244353
x,K = map(int,input().split())
p,q = x * pow(100,-1,mod) % mod,(100 - x) * pow(100,-1,mod) % mod

dp = [[[0 for m in range(K + 1)] for c in range(K + 1)] for n in range(2 * K + 1)]
dp[0][0][0] = 1

for n in range(2 * K):
  for c in range(K + 1):
    for m in range(K + 1):
      if c > 0:
        dp[n + 1][c - 1][m] = (dp[n + 1][c - 1][m] + dp[n][c][m] * q) % mod
      if c < K:
        dp[n + 1][c + 1][max(c + 1,m)] = (dp[n + 1][c + 1][max(c + 1,m)] + dp[n][c][m] * p) % mod

ans = 0
for m in range(1,K + 1):
  ans += m * dp[2 * K][0][m] % mod
  ans %= mod
print(ans)