mod = 998244353
def multiply(a, b):
    la = len(a)
    lb = len(b)
    r = [0] * (la + lb - 1)
    for i in range(la):
        for j in range(lb):
            r[i+j] += a[i] * b[j]
    return [x%mod for x in r]

lim = 2 << 17
k = 10

# 2 ** (2 * siz)
s = [1] * lim
for i in range(lim-1):
    s[i+1] = 4 * s[i] * s[i] % mod

ans = [[1,1]]
for i in range(1, lim):
    nxt = multiply(ans[-1], ans[-1])[:k+1]
    nxt[0] += s[i]
    ans.append(nxt)

t = int(input())
for i in range(t):
    n, k = map(int, input().split())
    print(ans[n-1][k-1])