import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,K = MI()
    A = LI()
    from itertools import combinations
    All = [i for i in range(N)]
    Ans = 0
    for P in combinations(A,K):
        S = 0
        for p in P:
            S += p
        if(S%MOD2 <= S%998):

            Ans+=1
    print(Ans%998)
    return
solve()