N, K = map(int, input().split())
A = list(map(int, input().split()))
p = 998
P = 998244353


def dfs(n):
    global cnt, sm, SM, ans
    if cnt == K:
        if sm >= SM:
            ans += 1
            ans %= p
        return
    if n == N:
        return
    a = A[n]
    sm += a
    sm %= p
    SM += a
    SM %= P
    cnt += 1
    dfs(n + 1)
    sm -= a
    sm %= p
    SM -= a
    SM %= P
    cnt -= 1

    dfs(n + 1)


cnt, sm, SM, ans = 0, 0, 0, 0
dfs(0)
print(ans)