#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define int long long

const int N = 1e5 + 10;
int val[N], cost[N], n, m, tot;
int ans;
const int MAXN = 1e6 + 10;
vector<int> v[5];
int f[5][MAXN * 4], g[5][MAXN * 4];
void solve(){
    for(int i = 1; i <= n; ++i){
        if(val[i] > 0){
            v[val[i]].push_back(cost[i]);
        }
    }
    for(int i = 1; i <= 4; ++i){
        sort(v[i].begin(), v[i].end());
        for(int j = 1; j < v[i].size(); ++j){
            v[i][j] += v[i][j - 1];
            if(v[i][j] > 1e14 + 1) v[i][j] = 1e14 + 1;
        }
    }

    for(int i = 1; i <= 4; ++i){
        v[i].push_back(0);
        for(int j = v[i].size() - 1; j >= 1; --j){
            v[i][j] = v[i][j - 1];
        }
        v[i][0] = 0;
        // for(int j : v[i]){
            // printf("%d ", j);
        // }
        // printf("\n");
    }
    // for(int  i= 1;i <= n; ++i) printf("%d ", cost[i]); printf("\n");
    // for(int  i= 1;i <= n; ++i) printf("%d ", val[i]); printf("\n");
    memset(f, 0x3f, sizeof(f));
    f[0][0] = 0;
    for(int i = 1; i <= 4; ++i){
        for(int j = 0; j <= n * 4; ++j){
            int len = v[i].size() - 1, maxk = min(len, j / i);
            if(g[i - 1][j]) maxk = min(maxk, g[i - 1][j]);
            for(int k = 0; k <= maxk; ++k){
                if(j - k * i >= 0){
                    int u = f[i - 1][j - k * i] + v[i][k];
                    if(u < f[i][j]){
                        f[i][j] = u;
                        g[i][j] = max(g[i][j], k);
                    }
                    // f[i][j] = min(f[i][j], f[i - 1][j - k * i] + v[i][k]);
                }
            }
        }
    }
    // printf("%lld\n", f[4][1]);
    // for(int i = 1; i <= 4; ++i){
    //     for(int j = 1; j <= n * 2; ++j){
    //         printf("%d ", g[i][j]);
    //     }
    //     printf("\n");
    // }
    int ans = 0;
    for(int i = 0; i <= n * 4; ++i){
        if(f[4][i] <= m){
            ans = i;
        }
    }
    printf("%lld\n", ans + tot);
}

signed main(){
    // freopen("DD.in", "r", stdin);
    // freopen("DD.out", "w", stdout);
    scanf("%lld %lld", &n, &m);
    tot = m % 5; m -= m % 5;
    for(int i = 1; i <= n; ++i){
        int x; scanf("%lld", &x);
        cost[i] = x + (5 - x % 5) % 5;
        val[i] = (5 - x % 5) % 5;
    }
    solve();
 
    return 0;
}

/*
5 57
9 14 31 18 27

4 50
11 11 11 11
*/