#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
map<T, T> getPrimeFactor(T n) {
  map<T, T> res;
  for (T i = 2; i * i <= n; ++i) {
    while (n % i == 0) {
      res[i]++;
      n /= i;
    }
  }
  if (n != 1) res[n] = 1;
  return res;
}
template <typename T>
bool IsPrimeNumber(T num) {
  if (num <= 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (int i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) {
      return false;
    }
  }
  return true;
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
map<ll, vll> m;
ll func(ll s) {
  ll ret = 0;
  for (ll i = 0; i < m[s].size(); i++) {
    ret = max(ret, func(m[s][i]));
  }
  return ret + 1;
}
int main() {
  ll N, A, ans = 0;
  std::cin >> N >> A;
  vll x(N);
  for (ll i = 0; i < N; i++) {
    std::cin >> x[i];
  }
  for (ll i = 0; i < (1LL << N); i++) {
    ll cnt = 0, sum = 0;
    for (ll j = 0; j < N; j++) {
      if (i & (1LL << j)) {
        sum += x[j];
        cnt++;
      }
    }
    if (cnt > 0 && sum == A * cnt) {
      ans++;
    }
  }
  std::cout << ans << endl;
  return 0;
}
