/* http://www.cnblogs.com/karl07/ */

 #include <cstdlib>

 #include <cstring>

 #include <cmath>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 #define ll long long

 ll n,m,mid,ans;

 ll c[],a[][],ca[];

 void dfs(int p,int x,ll cost){

     if (cost>m) return;

     if ((x>=mid && p==) || (x>=n && p==)){

         a[p][++ca[p]]=cost;

         return;

     }

     dfs(p,x+,cost+c[x+]);

     dfs(p,x+,cost);

 }

 int main(){

     scanf("%lld%lld",&n,&m);

     for (int i=;i<=n;i++) scanf("%lld",&c[i]);

     mid=n/;

     dfs(,,);

     dfs(,mid,);

     sort(a[]+,a[]+ca[]+);

     sort(a[]+,a[]+ca[]+);

     for (int l=,r=ca[];l<=ca[] && r>=;ans+=r,l++) while (a[][l]+a[][r]>m) r--;

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

     return ;

 }