X, K = map(int, input().split())

def inverse(n, d):
    return n * pow(d, -1, MOD) % MOD

MOD = 998244353
POW = []
for i in range(101):
    POW.append(inverse(i, 100))

ans = 0
for bit in range(1<<(2*K)):
    P = 1
    cnt = 0
    flag = False
    MAX = 0
    for i in range(2*K):
        if 1<<i & bit:
            cnt += 1
            MAX = max(MAX, cnt)
            P *= POW[X]
            P %= MOD
        else:
            cnt -= 1
            P *= POW[100-X]
            P %= MOD
        if cnt < 0:
            flag = True
            break
    if flag or cnt != 0:
        continue
    ans += MAX*P%MOD
    ans %= MOD

print(ans)