#include <bits/stdc++.h>
using namespace std;
template <typename T>
void DEBUG(T e) {
  if (true == false) return;
  std::cout << e << " ";
}
template <typename T>
void DEBUG(const std::vector<T>& v) {
  if (true == false) return;
  for (const auto& e : v) {
    std::cout << e << " ";
  }
  std::cout << std::endl;
}
template <typename T>
void DEBUG(const std::vector<std::vector<T> >& vv) {
  if (true == false) return;
  for (const auto& v : vv) {
    DEBUG(v);
  }
}
template <class T, class... Ts>
void DEBUG(T d, Ts... e) {
  if (true == false) return;
  DEBUG(d);
  DEBUG(e...);
}
template <class T>
void corner(bool flg, T hoge) {
  if (flg) {
    cout << hoge << endl;
    abort();
  }
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  return a > b && (a = b, true);
}
void solve(void) {
  long long N, A;
  cin >> N >> A;
  vector<long long> vec(N, 0);
  for (long long i = 0; i < N; i++) {
    cin >> vec[i];
  }
  vector<vector<long long> > DP(N + 1);
  DP[0].push_back(0);
  for (long long i = 0; i < N; i++) {
    long long prevc = 0;
    for (long long j = 0; j <= i; j++) {
      long long cnt = 0;
      for (long long k = 0; k < (long long)DP[j].size() - prevc; k++) {
        DP[j + 1].push_back(DP[j][k] + vec[i]);
        cnt++;
      }
      prevc = cnt;
    }
  }
  for (long long i = 0; i < N + 1; i++) {
    sort((DP[i]).begin(), (DP[i]).end());
  }
  long long ANS = 0;
  for (long long i = 1; i < N + 1; i++) {
    long long T = A * i;
    ANS += (long long)(upper_bound((DP[i]).begin(), (DP[i]).end(), T) -
                       lower_bound((DP[i]).begin(), (DP[i]).end(), T));
  }
  cout << ANS << endl;
  return;
}
int32_t main(int32_t argc, const char* argv[]) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout << std::fixed;
  std::cout << std::setprecision(9);
  solve();
  return 0;
}
