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

def depth(S: str) -> int:
    d = 0
    res = 0
    for c in S:
        if c == '(':
            d += 1
        else:
            d -= 1
            if d < 0:
                return 0
        res = max(res, d)
    if d == 0:
        return res
    return 0

# 深さがdとなる確率
prob_by_depth = [0] * (K+1)

for bit in range(1<<(2*K)):
    S = ''
    for i in range(2*K):
        if bit & 1<<i:
            S += '('
        else:
            S += ')'
    d = depth(S)
    prob_by_depth[d] += pow(p, K, mod) * pow(1-p, K, mod) % mod

ans = 0
for d in range(K+1):
    ans += d * prob_by_depth[d] % mod
    ans %= mod
print(ans)