1096_G. Lucky Tickets
All bus tickets in Berland have their numbers. A number consists of n digits (n is even). Only k decimal digits d_1, d_2, ..., d_k can be used to form ticket numbers. If 0 is among these digits, then numbers may have leading zeroes. For example, if n = 4 and only digits 0 and 4 can be used, then 0000, 4004, 4440 are valid ticket numbers, and 0002, 00, 44443 are not.

A ticket is lucky if the sum of first n / 2 digits is equal to the sum of remaining n / 2 digits. 

Calculate the number of different lucky tickets in Berland. Since the answer may be big, print it modulo 998244353.

Input

The first line contains two integers n and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ k ≤ 10) — the number of digits in each ticket number, and the number of different decimal digits that may be used. n is even.

The second line contains a sequence of pairwise distinct integers d_1, d_2, ..., d_k (0 ≤ d_i ≤ 9) — the digits that may be used in ticket numbers. The digits are given in arbitrary order.

Output

Print the number of lucky ticket numbers, taken modulo 998244353.

Examples

Input

4 2
1 8


Output

6


Input

20 1
6


Output

1


Input

10 5
6 1 4 0 3


Output

569725


Input

1000 7
5 4 0 1 8 3 2


Output

460571165

Note

In the first example there are 6 lucky ticket numbers: 1111, 1818, 1881, 8118, 8181 and 8888.

There is only one ticket number in the second example, it consists of 20 digits 6. This ticket number is lucky, so the answer is 1.
```python
from math import trunc

MOD = 998244353
MODF = float(MOD)
SHRT = float(1 << 16)

# Using pajenegod's crazy method for multiplication using floating point
fmod = lambda x: x - MODF * trunc(x / MODF)
mod_prod = lambda a, b: fmod(trunc(a / SHRT) * fmod(b * SHRT) + (a - SHRT * trunc(a / SHRT)) * b)
def fpow(a, b):
    r = 1.0
    while b:
        if b & 1: r = mod_prod(r, a)
        a = mod_prod(a, a)
        b >>= 1
    return r

n, k = map(int, input().split())
f = [0] * (5 * n + 5)
for d in map(int, input().split()):
    f[d] = 1

def ntt_transform(a, G, inv=False):
    n, k = 1, 0
    while n < len(a):
        k += 1
        n *= 2
    a += [0] * (n - len(a))
    
    n2 = n // 2
    w = [1] * n2
    w[1] = fpow(G, (MOD - 1) // n)
    if inv: w[1] = fpow(w[1], MOD - 2)
    for i in range(2, n2):
        w[i] = mod_prod(w[i - 1], w[1])

    rev = [0] * n
    for i in range(n):
        rev[i] = rev[i >> 1] >> 1
        if i & 1: rev[i] |= n2
        if i < rev[i]: a[i], a[rev[i]] = a[rev[i]], a[i]

    l = 2
    while l <= n:
        half, diff = l // 2, n // l
        for i in range(0, n, l):
            pw = 0
            for j in range(i, i + half):
                v = mod_prod(a[j + half], w[pw]);
                a[j + half] = a[j] - v if a[j] - v >= 0 else a[j] - v + MOD
                a[j] = a[j] + v if a[j] + v < MOD else a[j] + v - MOD
                pw += diff
        l *= 2

    if inv:
        inv_n = fpow(n, MOD - 2)
        for i in range(n): a[i] = mod_prod(a[i], inv_n);


ntt_transform(f, 3)
f = [fpow(x, n // 2) for x in f]
ntt_transform(f, 3, inv=True)

ans = sum(mod_prod(x, x) for x in f) % MODF
print(int(ans))
```