from sys import stdin
input = stdin.readline
import sys
sys.setrecursionlimit(10**6)

def func(n, k):
    if (n, k) in memo:
        return memo[(n, k)]
    if n == 1:
        if k <= 1:
            memo[(n, k)] = 1
        else:
            memo[(n, k)] = 0
        return memo[(n, k)]
    if k == 0:
        memo[(n, k)] = F[n]
        return F[n]
    ans = 0
    for i in range(k+1):
        ans += func(n-1, i)*func(n-1, k-i)%MOD
        ans %= MOD
    memo[(n, k)] = ans
    return ans

MOD = 998244353
F = [0, 1]
for n in range(2, 10**5*2+1):
    F.append(F[-1]*F[-1]%MOD+pow(4, (pow(2, n-1, MOD-1)-1)%(MOD-1), MOD))

memo = dict()

for _ in range(int(input())):
    N, K = map(int, input().split())

    print(func(N, K-1))