from functools import lru_cache

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

fact = [1] * (N+1)
fact_inv = [1] * (N+1)
for i in range(1, N+1):
    fact[i] = fact[i-1] * i % mod
    fact_inv[i] = pow(fact[i], mod-2, mod)

@lru_cache(None)
def C(n: int) -> int:
    res = 1
    for i in range(1, n):
        res -= S(n, i)
        if res < 0:
            res += mod
    return res

@lru_cache(None)
def S(n: int, k: int) -> int:
    return fact[n-1] * fact_inv[k-1] % mod * fact_inv[n-k] % mod \
            * C(k) % mod * pow(1-p, k*(n-k), mod) % mod

ans = 0
for k in range(1, N+1):
    ans += k * S(N, k)
    ans %= mod
print(ans)