from itertools import combinations
n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=0
MOD=998244353
mod=998

def solve(l):
    s=0
    for i in l:
        s+=a[i]
    if s%MOD <= s%mod:
        return True
    return False    
for i in combinations(range(n),k):
    l=list(i)
    if solve(l):
        ans+=1
print(ans%mod)