mod = 998
for _ in range(int(input())):
    n, m = map(int, input().split())
    T = []
    C = set([])
    now = 1
    while not now in C:
        C.add(now)
        T.append(now)
        now = now * n % mod
    I = {T[i]: i for i in range(len(T))}
    idx = I[now]
    B = [0]
    for t in T:
        B.append((B[-1] + t) % mod)
    for _ in range(m):
        k = int(input()) + 1
        if k < idx:
            ans = B[k]
        else:
            ans = B[idx]
            k -= idx
            s = len(T) - idx
            ans = (B[-1] - B[idx]) * (k // s) + B[k % s + idx]
        ans %= mod
        print(ans)