# 半分全列挙を思いつかないのはまずい。

import sys
input = sys.stdin.readline
from collections import defaultdict
import bisect

n,S=map(int,input().split())
A=list(map(int,input().split()))

B=A[:n//2]
C=A[n//2:]

DP=dict()
DP[0]=1

for a in B:
    NDP=defaultdict(int)
    for dp in DP:
        for i in range(1,100):
            if dp+a**i<=S:
                NDP[dp+a**i]+=DP[dp]
            else:
                break
    DP=NDP

DP2=dict()
DP2[0]=1

for a in C:
    NDP=defaultdict(int)
    for dp in DP2:
        for i in range(1,100):
            if dp+a**i<=S:
                NDP[dp+a**i]+=DP2[dp]
            else:
                break
    DP2=NDP
            
LIST=sorted(DP2)
X=[]

now=0
for i in range(len(LIST)):
    now+=DP2[LIST[i]]
    X.append(now)

X.append(0)
ANS=0
for dp in DP:
    k=S-dp

    xx=bisect.bisect(LIST,k)
    ANS+=DP[dp]*X[xx-1]

print(ANS)