#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(10);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /** 1000000007; //*/ 998244353;
////////////////

ll dp[8][512];
int ok[512][512];
void solve(){
  ini(N); inl(Y);
  vl a(N); in(a);
  ll S = 0; 
  each(x , a) S += x; 
  S /= 5;
  
  rep(i , N) rep(j , N){
    if(i == j) continue;
    ll cur = 0;
    for(int x = i ; x != j ; x = (x + 1) % N) cur += a[x];
    if(cur + Y >= S) ok[i][j] = 1;
  }

  ll ans = 0;
  // 始点決め
  for(int start = 0 ; start < N ; start++){
    
    // dp初期化
    rep(i , N * 2 + 1) rep(j , 6) dp[j][i] = 0;
    auto idx = [&](int n){return (n + N - start) % N ;};
    auto inv = [&](int n){return (n + start) % N ; };
    dp[0][0] = 1;
    rep(i , 5) rep(j , N){
      if(dp[i][j] == 0) continue;
      rep(k , N){
        int idxk = idx(k); if(idxk == 0) idxk = N;
        if(idxk <= j) continue;
        if(ok[inv(j)][k] == 1)
          dp[i + 1][ idxk ] += dp[i][j];
      }
    }
    //trc(start);
    //rep(i , 6) trca(dp[i] , N + 1);
    ans += dp[5][N];
  }
  out(ans / 5);


}


Measured memory_bytes: 3848