#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  ll n,s;cin>>n>>s;
  ll an=n/2; ll bn=n-an;
  vc<ll>a(an),b(bn); rep(i,an)cin>>a[i]; rep(i,bn)cin>>b[i];
  vc<ll>x;
  auto f=[&](auto f,vc<ll>v,ll now,ll d=0)->void{
    if(now==(ll)v.size()){
      x.pb(d);
      return;
    }
    for(ll i=1;;i++){
      ll nd=d+pow(v[now],i);
      if(nd>s)break;
      f(f,v,now+1,nd);
    }
    return;
  };
  f(f,a,0);
  auto y=x; x=vc<ll>(0);
  f(f,b,0);
  sort(all(y));
  ll ans=0;
  for(ll au:x){
    ll it=upper_bound(all(y),s-au)-y.begin();
    ans+=it;
  }
  cout<<ans;
}