#include <bits/stdc++.h>
template <class T>
bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf = 1LL << 62;
const ll mod = 1000000007LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll extgcd(ll a, ll b, ll &x, ll &y) {
  x = 1, y = 0;
  ll g = a;
  if (b != 0) g = extgcd(b, a % b, y, x), y -= a / b * x;
  return g;
}
ll ADD(const ll &a, const ll &b, const ll &mod) { return (a + b) % mod; }
ll SUB(const ll &a, const ll &b, const ll &mod) { return (a - b + mod) % mod; }
ll MUL(const ll &a, const ll &b, const ll &mod) { return (1LL * a * b) % mod; }
ll DIV(const ll &a, const ll &b, const ll &mod) {
  ll x, y;
  extgcd(b, mod, x, y);
  return MUL(a, (x + mod) % mod, mod);
}
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1, 6);
uniform_real_distribution<double> score(0.0, 10.0);
const int N = 60;
const int M = N * N;
ll dp[N][M][N];
int main(void) {
  int n, A;
  cin >> n >> A;
  vi x(n);
  for (auto &e : x) cin >> e;
  dp[0][0][0] = 1;
  for (int i = (int)(0); i < (int)(n); ++i) {
    for (int j = (int)(0); j < (int)(M); ++j) {
      for (int k = (int)(0); k < (int)(n); ++k) {
        int cur = dp[i][j][k];
        if (cur == 0) continue;
        dp[i + 1][j][k] += cur;
        dp[i + 1][j + x[i]][k + 1] += cur;
      }
    }
  }
  ll res = 0;
  for (int j = (int)(0); j < (int)(M); ++j) {
    for (int k = (int)(1); k < (int)(n + 1); ++k) {
      if (j == k * A) {
        res += dp[n][j][k];
      }
    }
  }
  cout << res << endl;
  return 0;
}
