#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
ll dp[50][120];
const int offset = 50;
int main() {
  int n, k;
  cin >> n >> k;
  V<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    a[i] -= k;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 120; j++) {
      if (dp[i][j]) dp[i + 1][j + a[i]] += dp[i][j];
      if (j == a[i] + offset) dp[i][j]++;
      dp[i + 1][j] += dp[i][j];
    }
  }
  cout << dp[n][offset] << endl;
}
