#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 10;
int n, first, a[N];
long long ans;
int dp[22][53][3333];
void DP(int m) {
  int s = 0, cur = 0;
  memset(dp[cur], 0, sizeof dp[0]);
  dp[0][0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    cur ^= 1;
    memcpy(dp[cur], dp[!cur], sizeof dp[0]);
    for (int j = 0; j <= m; ++j)
      for (int k = 0; k <= s; ++k) {
        dp[cur][j + 1][k + a[i]] += dp[!cur][j][k];
      }
    s += a[i];
  }
  ans += dp[cur][m][m * first];
}
int main() {
  cin >> n >> first;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int k = 1; k <= n; ++k) DP(k);
  printf("%lld\n", ans);
}
