import sys,math
#if len(sys.argv)==2:sys.stdin=open(sys.argv[1])
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect,bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from sortedcontainers import SortedList,SortedSet
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
#////////////////////////////////////
N,K = ms()
A = li()
ans = 0
num = [i for i in range(N)]
for com in combinations(num,K):
  s1 = 0
  s2 = 0
  for x in com:
    s1 += A[x]
    s1 %= 998
    s2 += A[x]
    s2 %= 998244353
  if s2<=s1: ans += 1
print(ans%998)