#include <bits/stdc++.h>
using namespace std;

const int N=50;
long long A[N],dp[N+1][N*N+1]; 
int main() {
  int n,x;
  cin >> n >> x;
  for ( int i=0; i<n; i++ ) cin >> A[i];
  dp[0][0]=1;
  int sum=0;
  for ( int i=0; i<n; i++ ) {
    for ( int j=i; ~j; j-- ) {
      for ( int k=sum; ~k; k-- ) {
        if  ( k+A[i]<=N*N ) dp[j+1][k+A[i]]+=dp[j][k];
      }
    }
    sum+=A[i];
  }
  long long ans=0;
  for ( int i=1; i<=n; i++ ) {
    ans+=dp[i][x*i];
  }
  cout << ans << '\n';
  return 0;
}
