#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 7;
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
const long double eps = 1e-8;
const long double pi = acos(-1.0);
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
void solve() {
  long long n, a;
  cin >> n >> a;
  vector<long long> x(n);
  for (long long i = 0; i < n; i++) {
    cin >> x[i];
  }
  long long dp[55][2550];
  for (long long i = 0; i < 55; i++) {
    for (long long j = 0; j < 2550; j++) {
      dp[i][j] = 0;
    }
  }
  dp[0][0] = 1;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < 2550; j++) {
      dp[i + 1][j] += dp[i][j];
      if (j + x[i] < 2550) dp[i + 1][j + x[i]] += dp[i][j];
    }
  }
  cout << dp[n][n * a] << endl;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
