#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class T, class S, class U> inline int Digit_L(T n, S res[], U b){
  int sz = 0;
  while(n){
    res[sz++] = n % b;
    n /= b;
  }
  return sz;
}
template<class T, class S> inline T pow_L(T a, S b){
  T res = 1;
  res = 1;
  for(;;){
    if(b&1){
      res *= a;
    }
    b >>= 1;
    if(b==0){
      break;
    }
    a *= a;
  }
  return res;
}
inline double pow_L(double a, double b){
  return pow(a,b);
}
int N;
long long W;
long long A[1000];
int digs[1000];
long long f[1<<16];
int main(){
  int i;
  rd(N);
  rd(W);
  {
    int PiIOrLma;
    for(PiIOrLma=(0);PiIOrLma<(N);PiIOrLma++){
      rd(A[PiIOrLma]);
    }
  }
  int ws =(pow_L(3,N));
  for(i=(0);i<(ws);i++){
    int j;
    for(j=(0);j<(N);j++){
      digs[j] = 0;
    }
    Digit_L(i, digs, 3);
    long long t = 0;
    long long total = 0;
    for(j=(0);j<(N);j++){
      if(digs[j] !=0 ){
        t = t + (1 << j);
      }
      if(digs[j] == 1){
        total = total + A[j];
      }
      if(digs[j] == 2){
        total = total + (A[j]/2);
      }
    }
    if(total == W){
      f[t] = 1;
    }
  }
  int EZ0PmQmu;
  long long zxsUT70f;
  if(1<<N==0){
    zxsUT70f = 0;
  }
  else{
    zxsUT70f = f[0];
    for(EZ0PmQmu=(1);EZ0PmQmu<(1<<N);EZ0PmQmu++){
      zxsUT70f += f[EZ0PmQmu];
    }
  }
  long long ans = zxsUT70f- f[0];
  wt_L(ans);
  wt_L('\n');
  return 0;
}
// cLay version 20210405-1

// --- original code ---
// int N;
// ll W, A[1d3];
// int digs[1d3];
// ll f[1<<16];
// {
//     rd(N, W, A(N));
//     int ws = 3 ** N;
//     rep(i, ws){
//         rep(j, N) digs[j] = 0;
//         Digit(i, digs, 3);
//         ll t = 0;
//         ll total = 0;
//         rep(j, N){
//             if(digs[j] !=0 ) t = t + (1 << j);
//             if(digs[j] == 1) total = total + A[j];
//             if(digs[j] == 2) total = total + (A[j]/2);
//         }
//         if(total == W){
//             f[t] = 1;
//         }
//     }
//     ll ans = sum(f(1<<N)) - f[0];
//     wt(ans);
// }