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//2 > W: continue
  for bit1 in range(1<<len(lst)):
    nsm = sm
    for i in range(len(lst)):
      if bit1>>i&1:
        nsm -= lst[i]//2
    if W == nsm:
      ans += 1
      break

print(ans)