Q=int(input())
for _ in range(Q):
  N,K=map(int,input().split())
  dp=[[0]*12 for i in range(N)]
  dp[0][0]=1
  dp[0][1]=1
  u=[0]*N
  u[0]=1
  mod=998244353
  mod2=mod-1
  for i in range(1,N):
    for a in range(11):
      for b in range(11):
        if a+b>10:
          break
        w=a+b
        if w>0:
          w+=1
        dp[i][a+b]+=dp[i-1][a]*dp[i-1][b]
        dp[i][a+b]%=mod
    u[i]=u[i-1]*2+1
    u[i]%=mod2
    count=u[i-1]*2
    count%=mod2
    dp[i][0]+=pow(2,count,mod)
    dp[i][0]%=mod
  result=dp[N-1][K-1]
  result%=mod
  print(result)