#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
from math import sin,cos
#from math import isqrt #DO NOT USE PyPy

ipt = sys.stdin.readline
iin = lambda :int(ipt())
lmin = lambda :list(map(int,ipt().split()))

#############################################################

m1 = 998
m2 = 998244353

N,K = lmin()
A = lmin()
cnt = 0
for p in combinations(A,K):
    S = sum(p)
    if S % m1 >= S % m2:
        cnt += 1

print(cnt%m1)