N,K=map(int,input().split())
A=[int(x) for x in input().split()]
ans=0

def two(f):
	if f:
		return 2
	else:
		return 1

for i in range(1<<N):
	if i==0:
		continue
	flag=False
	X=[A[j] for j in range(N) if (i>>j)&1]
	M=len(X)
	for k in range(1<<M):
		if sum([X[j]//(two((k>>j)&1)) for j in range(M)])==K:
			flag=True
			break
	if flag:
		ans+=1
print(ans)