#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 55;
const int mod = 1000000007;
template <class T>
inline bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline void line_out(const vector<T> vec) {
  int n = ((int)(vec).size());
  for (int i = 0; i < n; ++i) {
    cout << vec[i];
    if (i < n - 1) cout << " ";
  }
  cout << endl;
  return;
}
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint &operator++() {
    if ((x += 1) >= mod) x -= mod;
    return *this;
  }
  mint &operator--() {
    if ((x += mod - 1) >= mod) x -= mod;
    return *this;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};
int main() {
  int n, a;
  cin >> n >> a;
  vector<int> x(n), x1, x2;
  for (int i = 0; i < n; ++i) cin >> x[i];
  int n1 = n / 2, n2 = n - n / 2;
  for (int i = 0; i < n1; ++i) x1.push_back(x[i]);
  for (int i = 0; i < n2; ++i) x2.push_back(x[i + n1]);
  map<llP, ll> y1, y2;
  ll ans = 0;
  for (int bit = 1; bit < 1 << n1; ++bit) {
    ll sum = 0;
    int c = bitset<30>(bit).count();
    for (int i = 0; i < n1; ++i)
      if (bit & 1 << i) sum += x1[i];
    if (sum == a * c) ++ans;
    ++y1[make_pair(c, sum)];
  }
  for (int bit = 1; bit < 1 << n2; ++bit) {
    ll sum = 0;
    int c = bitset<30>(bit).count();
    for (int i = 0; i < n2; ++i)
      if (bit & 1 << i) sum += x2[i];
    if (sum == a * c) ++ans;
    ++y2[make_pair(c, sum)];
  }
  for (auto t : y1) {
    ll c = t.first.first, sum = t.first.second;
    ll num1 = t.second;
    for (int i = c + 1; i <= 50; ++i) {
      if (y2.find(make_pair(i - c, i * a - sum)) == y2.end()) continue;
      ll num2 = y2.find(make_pair(i - c, i * a - sum))->second;
      ans += num1 * num2;
    }
  }
  cout << ans << endl;
}
