#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define rp(i,x,y) for(register ll i=x;i<=y;++i)

const ll N=,M=;

ll n,m,cst[N],cnt1,cnt2,sum1[M],sum2[M],ans;

inline ll read()

{

    char ch=getchar();ll x=;bool y=;

    while(ch!='-' && (ch>'' || ch<''))ch=getchar();

    if(ch=='-')ch=getchar(),y=;

    while(ch>='' && ch<='')x=(x<<)+(x<<)+(ch^''),ch=getchar();

    return y?x:-x;

}

inline void dfs1(ll x,ll y)

{

    if(y>m)return ;if(x>(n>>)){sum1[++cnt1]=y;return;}

    dfs1(x+,y);dfs1(x+,y+cst[x]);

}

inline void dfs2(ll x,ll y)

{

    if(y>m)return ;if(x>n){sum2[++cnt2]=y;return;}

    dfs2(x+,y);dfs2(x+,y+cst[x]);

}

int main()

{

    n=read();m=read();rp(i,,n)cst[i]=read();

    dfs1(,);dfs2((n>>)+,);

    sort(sum2+,sum2++cnt2);sort(sum1+,sum1++cnt1);

    rp(i,,cnt1)ans+=upper_bound(sum2+,sum2++cnt2,m-sum1[i])-sum2-;

    printf("%lld\n",ans);

    return ;

}