import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from collections import Counter

def mid(xx):
    cnt = Counter()
    cnt[0] = 1
    for x in xx:
        nc = Counter()
        for t, c in cnt.items():
            e = 1
            while t+x**e <= s:
                nc[t+x**e] += c
                e += 1
        cnt = nc
        # print(cnt)
    return sorted(cnt.items())

n, s = LI()
aa = LI()
if n < 5:
    cnt = mid(aa)
    # print(cnt)
    ans = sum(c for a, c in cnt)
else:
    pre = aa[:n//2]
    pos = aa[n//2:]
    ll = mid(pre)
    rr = mid(pos)
    j = 0
    t = 0
    ans = 0
    for i in range(len(ll))[::-1]:
        while j < len(rr) and ll[i][0]+rr[j][0] <= s:
            t += rr[j][1]
            j += 1
        ans += ll[i][1]*t
print(ans)