from bisect import bisect_left
def acum(List):#累積和
    rev = [0 for _ in range(len(List))]
    for i in range(len(List)):
        if i == 0:
            rev[i] = List[i]
        else:
           rev[i] = rev[i-1] + List[i] 
    return rev
from itertools import product 
n,S = map(int,input().split())
A = list(map(int,input().split()))
if n >= 2:
    front = []
    back = []
    for a in A[:n//2]:
        front .append(a)
    for a in A[n//2:]:
        back.append(a)
    Plist = []
    for Ks in product([i for i in range(1,33)],repeat = len(front)):
        P = 0
        for l in range(len(front)):
            P += pow(front[l],Ks[l])
            if P > S:
                break

        if P <= S:
            Plist.append(P)
    Qlist = []
    for Ks in product([i for i in range(1,33)],repeat=len(back)):
        Q = 0
        for l in range(len(back)):
            Q += pow(back[l],Ks[l])
            if Q > S:
                break
        if Q <= S:
            Qlist.append(Q)
    Plist.sort()
    Qlist.sort()
    cntP = [0] * len(set(Plist))
    cntQ = [0] * len(set(Qlist))
    index = 0
    qlist = sorted(list(set(Qlist)))
    plist = sorted(list(set(Plist)))
    for p in Plist:
        if plist[index] == p:
            cntP[index] += 1
        else:
            index += 1
            cntP[index] += 1
    index = 0
    for q in Qlist:
        if qlist[index] == q:
            cntQ[index] += 1
        else:
            index += 1
            cntQ[index] += 1
    cum = acum(cntQ)
    ans = 0
    for i,p in enumerate(plist):
        index = bisect_left(qlist,S-p+1) -1
        if index == -1:
            continue
        ans += cntP[i] * cum[index] 
    print(ans)
else:
    for k in range(1,33):
        if pow(A[0],k) <= S:
            pass
        else:
            break
    print(k-1)