def extgcd(a, b):
    if b:
        d, y, x = extgcd(b, a % b)
        y -= (a // b) * x
        return d, x, y
    return a, 1, 0


# 以下modinv
def mod_inv(a, m):
    g, x, y = extgcd(a, m)

    if g != 1:
        raise Exception()

    if x < 0:
        x += m

    return x


x, K = map(int, input().split())
p = 998244353
"""
dp[i個目まで選んだ][深さj][最大の深さ]
"""
inv = x*mod_inv(100, p)%p
inv2=(100-x)*mod_inv(100,p)%p
dp = [[[0 for _ in range(K + 1)] for _ in range(K + 1)] for _ in range(2 * K + 1)]
dp[0][0][0]=1
for i in range(2 * K):
    for j in range(K + 1):
        for k in range(K + 1):
            # (を選ぶ  
            if j < K:
                dp[i + 1][j + 1][max(j + 1, k)] += dp[i][j][k] * inv
                dp[i + 1][j + 1][max(j + 1, k)] %= p
            if j != 0:
                dp[i + 1][j - 1][k] += dp[i][j][k] * inv2
                dp[i + 1][j - 1][k] %= p
ans = 0
for i in range(K + 1):
    ans += dp[-1][0][i] * i
    ans%=p
print(ans)