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

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[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => int.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var a = NList;
        if (n < 7) WriteLine(string.Join("\n", GoShort(n, m, k, a)));
        else WriteLine(string.Join("\n", Go(n, m, k, a)));
    }
    static long[] Go(int n, int m, int k, int[] a)
    {
        var mod = 998_244_353;
        var dp1 = new long[n * 2 + 1];
        var dp2 = new long[n * 2 + 1];
        dp1[0] = 1;
        for (var i = 0; i + 1 < dp1.Length; ++i)
        {
            for (var p = 1; p <= 6; ++p)
            {
                if (i + p >= dp1.Length) dp1[^1] = (dp1[^1] + dp1[i]) % mod;
                else dp1[i + p] = (dp1[i + p] + dp1[i]) % mod;
            }
        }
        dp2[^1] = 1;
        dp2[^2] = 5;
        dp2[^3] = 4;
        dp2[^4] = 3;
        dp2[^5] = 2;
        dp2[^6] = 1;
        for (var i = dp2.Length - 1; i > 0; --i)
        {
            for (var p = 1; p <= 6; ++p)
            {
                if (i - p < 0) dp2[0] = (dp2[0] + dp2[i]) % mod;
                else dp2[i - p] = (dp2[i - p] + dp2[i]) % mod;
            }
        }
        var ans = new long[k];
        for (var i = 0; i < k; ++i)
        {
            ans[i] = (dp1[a[i]] * dp2[a[i]] % mod + dp1[n + a[i]] * dp2[n + a[i]] % mod
                - dp1[a[i]] * dp1[n] % mod * dp2[n + a[i]] % mod + mod) % mod;
        }
        return ans;
    }
    static long[] GoShort(int n, int m, int k, int[] a)
    {
        var ans = new long[k];
        var mod = 998_244_353;
        for (var i = 0; i < k; ++i)
        {
            var dp1 = new long[n * 2 + 1];
            var dp2 = new long[n * 2 + 1];
            dp1[0] = 1;
            for (var j = 0; j + 1 < dp1.Length; ++j)
            {
                for (var p = 1; p <= 6; ++p)
                {
                    if (j + p >= dp1.Length) dp1[^1] = (dp1[^1] + dp1[j]) % mod;
                    else if ((j + p) % n == a[i]) dp2[j + p] = (dp2[j + p] + dp1[j]) % mod;
                    else dp1[j + p] = (dp1[j + p] + dp1[j]) % mod;
                    if (j + p >= dp2.Length) dp2[^1] = (dp2[^1] + dp2[j]) % mod;
                    else dp2[j + p] = (dp2[j + p] + dp2[j]) % mod;
                }
            }
            ans[i] = dp2[^1];
        }
        return ans;
    }
}