import sys
sys.setrecursionlimit(100000)
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod1 = 998
mod2 = 998244353

ans = 0

def dfs(idx, s, num):
    global ans
    if num==k:
        if s%mod1>=s%mod2: ans+=1
        return

    for i in range(idx+1, n):
        dfs(i, s+a[i], num+1)
        
for j in range(n):
    dfs(j, a[j], 1)
print(ans%mod1)