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 = input()
        if len(k) < 30:
            k = int(k) + 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)
        else:
            ans = B[idx]
            s = len(T) - idx
            MOD = s * 998
            tmp = 0
            now = 1
            for t in k[::-1]:
                tmp += int(t) * now % MOD
                now = now * 10 % MOD
            tmp -= idx - 1
            tmp %= MOD
            ans = (B[-1] - B[idx]) * (tmp // s) + B[tmp % s + idx]
            ans %= mod
            print(ans)