import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
50 2
100 5
31 4
"""

mod=998244353
def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  x,K=map(int,input().split())
  y=pow(x,K,mod)*pow(100-x,K,mod)*pow(100,2*K*(mod-2),mod)%mod
  ans=0
  for i in range(2**(2*K)):
    depth=0
    flg=0
    now=0
    for j in range(2*K):
      if (i>>j)&1:
        now+=1
      else:
        now-=1
      if now<0:
        flg=1
        break
      depth=max(depth,now)
    if flg==0 and now==0:
      ans+=depth*y
      ans%=mod
  print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)