import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N,S=map(int,readline().split())
A=list(map(int,readline().split()))
K=[0]*N
for i in range(N):
    while A[i]**(K[i]+1)<=S:
        K[i]+=1
n=N//2
lst=[]
for tpl in itertools.product(*[range(1,k+1) for k in K[:n]]):
    s=sum(a**k for a,k in zip(A[:n],tpl))
    if s<=S:
        lst.append(s)
lst.sort()
ans=0
for tpl in itertools.product(*[range(1,k+1) for k in K[n:]]):
    s=sum(a**k for a,k in zip(A[n:],tpl))
    ans+=bisect.bisect_right(lst,S-s)
print(ans)