#import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
import math
import bisect
import heapq
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e20)
mod = 998244353

n,w = mp()
a = lmp()
ans = 0
for i in range(1,1<<n):
    cnt = 0
    lst = []
    for j in range(n):
        if i & 1<<j == 1<<j:
            cnt += a[j]
            lst.append(a[j]//2)
    if cnt < w:continue
    dif = cnt-w
    #print(lst,dif)
    flag = False
    for j in range(1<<len(lst)):
        c = 0
        for k in range(len(lst)):
            if j & 1<<k == 1<<k:
                c += lst[k]
        if c == dif:
            flag = True
    if flag:ans += 1

print(ans)