#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i,l,r) for(i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
signed main(){
  ll N,A,i,j,k;cin>>N>>A;ll X[N],DP[N+1][4901];
  REP(i,N){cin>>X[i];X[i]-=A;}
  REP(i,4901)DP[0][i]=0;DP[0][2450]=1;
  FOR(i,1,N+1)REP(j,4901){
    DP[i][j]=DP[i-1][j];
    if(j-X[i-1]>=0&&j-X[i-1]<=4900)DP[i][j]+=DP[i-1][j-X[i-1]];
  }
  cout<<DP[N][2450]-1<<endl;
  return 0;
}