#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<map>
#include<iomanip>
#include<limits>
#include<unordered_set> 
#include<cmath>
using namespace std;
//long long p = 998244353;
long long p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(int i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp make_pair
#define pin pair<int,int>
#define qin pair<pin,int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define fcout cout << fixed << setprecision(15)
#define rev(s) reverse(s.begin(),s.end())
#define lower(h,val) lower_bound(h.begin(),h.end(),val)-h.begin()
#define upper(h,val) upper_bound(h.begin(),h.end(),val)-h.begin()
int max_kai = 150000;
vel kai(max_kai, 1);
vel inv_kai;
int rui(int a, int n, int mod) {
    if (n == 0) { return 1 % mod; }
    int x = rui(a, n / 2, mod);
    x *= x; x %= mod;
    if (n % 2 == 1) { x *= a; x %= mod; }
    return x;
}
vel pa;
int root(int x) {
    if (pa[x] == -1) { return x; }
    int ans = root(pa[x]); pa[x] = ans;
    return ans;
}
void marge(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) { pa[x] = y; }
}
int gcd(int x, int y) {
    if (x < y) { return gcd(y, x); }
    if (y == 0) { return x; }
    return gcd(y, x % y);
}
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
vel uni(vel x) {
    if (x.size() == 0) { return x; }
    sor(x);
    int n = x.size();
    vel ans(1, x[0]);
    for (int j = 1; j < n; j++) {
        if (x[j - 1] != x[j]) { ans.push_back(x[j]); }
    }
    x = ans;
    return x;
}
void pr(vel& v) {
    int n = v.size();
    if (n != 0) {
        cout << v[0];
        rep(i, n - 1) {
            cout << " " << v[i + 1];
        }
        cout << endl;
    }
}
int sol(int x, int k) {
    if (x == 0 || k == 0) { return 0; }
    return x + sol(x / 2, k - 1);
}
vel dis(vvel& way, int n, int st) {
    vel dist(n, n + 1);
    dist[st] = 0;
    queue<int> q;
    q.push(st);
    while (!q.empty()) {
        int x = q.front(); q.pop();
        for (auto y : way[x]) {
            if (dist[y] > dist[x] + 1) {
                dist[y] = dist[x] + 1;
                q.push(y);
            }
        }
    }
    return dist;
}
int solve(vel& v, int s) {
    int n = v.size();
    vvel dp(6,vel(n,0));
    dp[0][0] = 1;
    rep(i, 5) {
        rep(j, n) {
            int st = lower_bound(v.begin(), v.end(), v[j] + s) - v.begin();
            if (st == j) { st++; }
            for (int k = st; k < n; k++) {
                dp[i + 1][k] += dp[i][j];
            }
        }
    }
    return dp[5][n - 1];
}
signed main() {
    int n; cin >> n;
    int y; cin >> y;
    int sum = 0;
    vel a(n);
    rep(i, n) { 
        cin >> a[i]; sum += a[i]; 
    }
    sum /= 5; sum -= y;
    if (sum < 0) { sum = 0; }
    int ans = 0;
    rep(i, n) {
        vel b(n);
        rep(j, n) { b[j] = a[(i + j) % n]; }
        vel s(n + 1, 0);
        rep(i, n) {
            s[i + 1] = s[i] + b[i];
        }
        ans += solve(s, sum);
    }
    cout << ans / 5 << endl;
    return 0;
    return 0;
}

