#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1<<30;
int main(){
  ll n, a;cin>>n>>a;
  vector<int> x(n);
  for(int i=0;i<n;i++){
    ll s;cin>>s;x[i]=s-a;
  }
  vector<vector<ll>> dp(n+1, vector<ll>(2*n*50+1, 0));
  dp[0][n*50]=1;
  for(int i=1;i<=n;i++){
    for(int j=0;j<=2*n*50;j++){
      if(0<=j-x[i-1] && j-x[i]<=2*n*50){
      	dp[i][j]=dp[i-1][j-x[i-1]]+dp[i-1][j];
      }else{
	    dp[i][j]=dp[i-1][j];
      }
    }
  }
  cout<<dp[n][n*50]-(ll)1<<endl;
}