from sys import stdin,setrecursionlimit,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18 
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import * 

t = ii()

mod = 998 

def solve():
    n,m = mi() 
    roop1 = [] 
    s = set()
    x = 1 

    while not x in s:
        s.add(x) 
        roop1.append(x) 
        x *= n 
        x %= mod 

    roop2 = [x] 
    x = (x*n) % mod 
    while x != roop2[0]:
        roop2.append(x) 
        x *= n 
        x %= mod 

    for i in range(1,len(roop1)):
        roop1[i] += roop1[i-1]
        roop1[i] %= mod 

    for i in range(1,len(roop2)):
        roop2[i] += roop2[i-1]
        roop2[i] %= mod    

    N = len(roop1)
    M = len(roop2)

    # print(roop1)
    # print(roop2)
    for i in range(m):
        k = ii()
        if k < N:
            print(roop1[k])
            continue
        ans = roop1[-1]
        k -= N 
        # if M == 0:
        #     print(ans)
        #     continue
        rp,nokori = divmod(k,M)
        ans += rp*roop2[-1] + roop2[nokori]
        print(ans % mod)



for i in range(t):
    solve()