import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]


def main():
    n,S = map(int,input().split())
    A = list(map(int,input().split()))
    kouho = []
    for a in A:
        temp = [a]
        while temp[-1]*a <= S:
            temp.append(temp[-1]*a)
        kouho.append(temp)
    #print(kouho)

    #dp[x]: x余っている時の場合の数
    mid = n//2
    dp = defaultdict(int)
    dp[S] = 1
    for i in range(mid):
        p = defaultdict(int)
        p,dp = dp,p
        for x in p:
            for v in kouho[i]:
                if v > x: break
                dp[x-v] += p[x]
    pat = []
    for x,v in dp.items():
        #残りxとなるときがv通り
        pat.append((x,v))
    pat.sort()
    nokori = []
    cum = [0]
    for x,v in pat:
        nokori.append(x)
        cum.append(cum[-1]+v)
    #print(nokori)
    #print(cum)
    total = cum[-1]

    dp = defaultdict(int)
    #dp[x]: x使った時の場合の数
    dp[0] = 1
    for i in range(mid,n):
        p = defaultdict(int)
        p,dp = dp,p
        for x in p:
            for v in kouho[i]:
                if x+v > S: break
                dp[x+v] += p[x]
    #print(dp)
    ans = 0
    for x,v in dp.items():
        #x使った時v通り
        #nokoriがx以下となるときの値を足せる。
        idx = bisect.bisect_left(nokori,x)
        ans += (total - cum[idx]) * v

    print(ans)

if __name__ == '__main__':
    main()