def solve():
    mod = 998244353
    n, k = map(int,input().split())
    ans = 0
    for i in range(1, k + 1):
        ans += pow(i+1, n, mod)
        ans %= mod
    print(ans)
    

for _ in range(int(input())):
    solve()