#include<bits/stdc++.h>
#define ls (i<<1)
#define rs (i<<1|1)
#define mid ((l+r)>>1)
using namespace std;
typedef long long LL;
const int mxn=1000010;
int n;
int a[6][mxn];
LL s[6][mxn];
int calc(int cur,LL m,int l,int r){
	if (m<0) return -1e9;
	if (!cur) return 0;
	if (r-l+1<=50){
		int ret=0;
		for (int i=l;i<=r;++i)
			ret=max(ret,calc(cur-1,m-s[cur][i],0,a[cur-1][0])+i*cur);
	//	printf("%d %d %d\n",cur,pos,ret);
		return ret;
	}
	int ml=(l+r)/3,mr=(l+r)*2/3;
	int al=calc(cur-1,m-s[cur][ml],0,a[cur-1][0])+ml*cur,
		ar=calc(cur-1,m-s[cur][mr],0,a[cur-1][0])+mr*cur;
	if (al<ar) return calc(cur,m,ml,r);
	else return calc(cur,m,l,mr);
}
int main()
{
	LL m;
	scanf("%d%lld",&n,&m);
	for (int i=1,x;i<=n;++i){
		scanf("%d",&x);
		a[5-x%5][++a[5-x%5][0]]=(x/5+1)*5;
	}
	for (int i=1;i<5;++i){
		sort(a[i]+1,a[i]+a[i][0]+1);
		for (int j=1;j<=a[i][0];++j)
			s[i][j]=s[i][j-1]+a[i][j];
	}
	int x=m%5;
	printf("%d\n",calc(4,m/5*5,0,a[4][0])+x);
	return 0;
}