#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& o, const pair<T1, T2> p) {
  o << "(" << p.first << ":" << p.second << ")";
  return o;
}
namespace {
std::chrono::system_clock::time_point ttt;
void tic() { ttt = chrono::system_clock::now(); }
void toc() {
  fprintf(stderr, "TIME : %lldms\n",
          (chrono::duration_cast<chrono::milliseconds>(
               chrono::system_clock::now() - ttt)
               .count()));
}
std::chrono::system_clock::time_point tle = chrono::system_clock::now();
}  // namespace
namespace {
class MaiScanner {
 public:
  template <typename T>
  void input_integer(T& var) {
    var = 0;
    T sign = 1;
    int cc = getchar_unlocked();
    for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() { return getchar_unlocked(); }
  inline MaiScanner& operator>>(int& var) {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner& operator>>(long long& var) {
    input_integer<long long>(var);
    return *this;
  }
  inline MaiScanner& operator>>(string& var) {
    int cc = getchar_unlocked();
    for (; !(0x21 <= (cc) && (cc) <= 0x7E); cc = getchar_unlocked())
      ;
    for (; (0x21 <= (cc) && (cc) <= 0x7E); cc = getchar_unlocked())
      var.push_back(cc);
  }
};
}  // namespace
MaiScanner scanner;
long long int m, n, kei;
long long int xdp[50][3000];
long long int ydp[50][3000];
int main() {
  scanner >> n >> kei;
  vector<int> xx;
  vector<int> yy;
  for (auto cnt = 0; cnt < (n); ++cnt) {
    int x;
    scanner >> x;
    x -= kei;
    if (0 < x) xx.push_back(x);
    if (0 > x) yy.push_back(-x);
    m += (0 == x);
  }
  xdp[0][0] = 1;
  for (int i = 0; i < xx.size(); ++i) {
    int e = xx[i];
    for (int x = 0; x < 2500; ++x) {
      xdp[i + 1][x + e] += xdp[i][x];
      xdp[i + 1][x] += xdp[i][x];
    }
  }
  ydp[0][0] = 1;
  for (int i = 0; i < yy.size(); ++i) {
    int e = yy[i];
    for (int y = 0; y < 2500; ++y) {
      ydp[i + 1][y + e] += ydp[i][y];
      ydp[i + 1][y] += ydp[i][y];
    }
  }
  long long int zero = (1ll << m);
  long long int result = (zero - 1ll);
  for (int z = 1; z <= 2500; ++z) {
    result += xdp[xx.size()][z] * ydp[yy.size()][z] * zero;
  }
  cout << result << endl;
  return 0;
}
