#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T>
inline T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
template <class T>
inline T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
const long long MAXN = 55, K = 200043, M = 2500, INF = 1e18 + 7;
const long double PI = acos(-1.0);
long long MOD = 1e9 + 7;
template <class T>
T sqr(T a) {
  return a * a;
}
long long mul(long long a, long long b) {
  return ((a % MOD) * (b % MOD)) % MOD;
}
long long sum(long long a, long long b) {
  return ((a % MOD) + (b % MOD)) % MOD;
}
long long sub(long long a, long long b) { return sum(a, MOD - b); }
long long bin_pow(long long a, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = mul(res, a);
    a = mul(a, a);
    n >>= 1;
  }
  return res;
}
long long inv(long long x) { return bin_pow(x, MOD - 2) % MOD; }
long long dp[MAXN][MAXN][4000];
void solve() {
  int n, a;
  cin >> n >> a;
  vector<int> x(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> x[i];
  }
  for (int i = 0; i <= n; ++i) dp[i][0][0] = 1;
  for (int pref = 1; pref <= n; ++pref) {
    for (int cnt = 1; cnt <= n; ++cnt) {
      for (int sum = 0; sum < M; ++sum) {
        dp[pref][cnt][sum] = dp[pref - 1][cnt][sum];
        if (sum >= x[pref])
          dp[pref][cnt][sum] += dp[pref - 1][cnt - 1][sum - x[pref]];
      }
    }
  }
  long long ans = 0;
  for (long long cnt = 1; cnt <= n; ++cnt) {
    for (long long sum = 1; sum < M; ++sum) {
      if (sum == cnt * a) {
        ans += dp[n][cnt][sum];
      }
    }
  }
  cout << ans << '\n';
  ;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t-- > 0) solve();
  return 0;
}
