#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 = 32005, K = 200043, M = 1000043, 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;
}
void solve() {
  int n, A;
  cin >> n >> A;
  vector<int> x(n), y, z;
  for (int i = 0; i < n; ++i) cin >> x[i];
  int l = n / 2, r = n - n / 2;
  for (int i = 0; i < l; ++i) y.push_back(x[i]);
  for (int i = l; i < n; ++i) z.push_back(x[i]);
  map<pair<int, int>, int> m1, m2;
  for (int i = 1; i < (1 << l); ++i) {
    bitset<26> b(i);
    int sum = 0;
    for (int j = 0; j < l; ++j) sum += b[j] * y[j];
    m1[{sum, b.count()}]++;
  }
  for (int i = 1; i < (1 << r); ++i) {
    bitset<26> b(i);
    int sum = 0;
    for (int j = 0; j < r; ++j) sum += b[j] * z[j];
    m2[{sum, b.count()}]++;
  }
  long long ans = 0;
  for (auto it = m1.begin(); it != m1.end(); ++it) {
    int sum = it->first.first, cnt = it->first.second;
    ans += (sum == cnt * A) * it->second;
  }
  for (auto it = m2.begin(); it != m2.end(); ++it) {
    int sum = it->first.first, cnt = it->first.second;
    ans += (sum == cnt * A) * it->second;
  }
  for (auto it = m1.begin(); it != m1.end(); ++it) {
    int sum = it->first.first, cnt = it->first.second;
    for (int i = 1; i <= r; ++i)
      ans += it->second * m2[{(cnt + i) * A - sum, i}];
  }
  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;
}
