n, w = map(int, input().split())
a = list(map(int, input().split()))
b = [x // 2 for x in a]

answer = 0

for mask in range(1, 1 << n):
    s_b = []
    for i in range(n):
        if (mask >> i) & 1:
            s_b.append(b[i])
    sum_b = sum(s_b)
    required_T = w - sum_b
    if required_T < 0:
        continue
    
    # Generate all possible subset sums of s_b
    subset_sums = {0}
    for num in s_b:
        new_sums = set()
        for s in subset_sums:
            new_sum = s + num
            new_sums.add(new_sum)
        subset_sums.update(new_sums)
    
    if required_T in subset_sums:
        answer += 1

print(answer)