#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
bool paircomp(const pair<ll, ll> &a, const pair<ll, ll> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, A;
  cin >> N >> A;
  vl X(N);
  vvl DP = vector<vector<ll>>(N + 1, vector<ll>(5001, 0));
  for (ll i = 0; i < (N); i++) {
    cin >> X[i];
    X[i] = X[i] - A + 50;
  }
  DP[0][0] = 1;
  for (ll i = 0; i < (N); i++) {
    auto DPC = DP;
    for (ll k = 0; k < (N); k++) {
      for (ll j = 0; j < (5100); j++) {
        if (j < X[i]) continue;
        DP[k + 1][j] += DPC[k][j - X[i]];
      }
    }
  }
  ll ans = 0;
  for (ll i = (1); i < (N + 1); i++) {
    ans += DP[i][i * 50];
  }
  cout << ans << endl;
  return 0;
}
