x,k = map(int,input().split())
z = 998244353; p = 0
for s in range(1<<2*k):
    c = d = 0; f = 1; m = s.bit_count()
    for i in range(2*k):
        if s>>i&1: c += 1; d = max(d,c)
        elif c: c -= 1
        else: f = 0; break
    if f and c==0: p += pow(x,m,z)*pow(100-x,2*k-m,z)%z*d
print(p*pow(100,-2*k,z)%z)