x, K = map(int, input().split())
mod = 998244353
pre = [[0] * (K + 1) for _ in range(K + 1)]
pre[0][0] = 1
for i in range(2 * K):
    dp = [[0] * (K + 1) for _ in range(K + 1)]
    for j in range(K + 1):
        for d in range(j, K + 1):
            if j:
                if j == d:
                    dp[j][d] += pre[j - 1][d - 1]
                    dp[j][d] += pre[j - 1][d]
                else:
                    dp[j][d] += pre[j - 1][d]
            if j != K:
                dp[j][d] += pre[j + 1][d]
            dp[j][d] %= mod
    pre, dp = dp, pre
    
ans = 0
for d in range(K + 1):
    ans += pre[0][d] * d
    ans %= mod
ans *= pow(x, K, mod) * pow(100 - x, K, mod) * pow(100, 2 * K * (mod - 2), mod) % mod
ans %= mod
print(ans)