using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Globalization;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new List<long>();
        for (var u = 0; u < t; ++u)
        {
            var c = NList;
            var (n, m) = (c[0], c[1]);
            var k = SList(m);
            ans.AddRange(Mod(n, m, k));
        }
        WriteLine(string.Join("\n", ans));
    }
    static List<long> Mod(int n, int m, string[] k)
    {
        var ans = new List<long>();
        var mod = 998;
        if (n % mod == 0)
        {
            for (var i = 0; i < m; ++i) ans.Add(1);
            return ans;
        }
        if (n == 1)
        {
            foreach (var ki in k)
            {
                var tmp = 0L;
                for (var i = 0; i < ki.Length; ++i)
                {
                    tmp = (tmp * 10 + ki[i] - '0') % mod;
                }
                tmp = (tmp + 1) % mod;
                ans.Add(tmp);
            }
            return ans;
        }
        var lmod = (n - 1) * mod;
        foreach (var ki in k)
        {
            var mul = (long)n % lmod;
            var tmp = (long)n % lmod;
            for (var i = ki.Length - 1; i >= 0; --i)
            {
                tmp = tmp * Exp(mul, ki[i] - '0', lmod) % lmod;
                mul = Exp(mul, 10, lmod);
            }
            tmp = (tmp - 1 + lmod) % lmod;
            ans.Add(tmp / (n - 1));
        }
        return ans;
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}