N, W = map(int, input().split())
A = list(map(int, input().split()))
ans = 0

for bit in range(1<<N):
  lst = []
  for i in range(N):
    if bit>>i&1:
      lst.append(A[i])
  sm = sum(lst)
  if sm == W: ans += 1
  for i in range(len(lst)):
    nsm = sm - lst[i]//2
    if nsm == W:
      ans += 1

print(ans)