#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 1e5 + 5;

ll n, x0, X, ans, a[N], pos0[5], pos1[5], p[5][N], sum[5][N];

inline void solve() {
	for (int i = max(0ll, pos1[1] - 13); i <= min(pos0[1], pos1[1] + 12); ++i) {
		for (int j = max(0ll, pos1[2] - 7); j <= min(pos0[2], pos1[2] + 6); ++j) {
			for (int k = max(0ll, pos1[3] - 5); k <= min(pos0[3], pos1[3] + 4); ++k) {
				for (int l = max(0ll, pos1[4] - 4); l <= min(pos0[4], pos1[4] + 3); ++l) {
					ans = max(ans, min(X - sum[1][i] - sum[2][j] - sum[3][k] - sum[4][l], (ll)i + j * 2 + k * 3 + l * 4));
				}
			}
		}
	}
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> X;
	x0 = X % 5;
	X -= x0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		p[(5 - a[i] % 5) % 5][++pos0[(5 - a[i] % 5) % 5]] = a[i];
	}
	for (int i = 1; i <= 4; ++i) {
		sort(p[i] + 1, p[i] + pos0[i] + 1);
		for (int j = 1; j <= pos0[i]; ++j) {
			sum[i][j] = sum[i][j - 1] + p[i][j];
		}
	}
	for (int i = 1; i <= 4; ++i) {
		pos1[i] = 1;
		p[i][pos0[i] + 1] = 1e18;
	}
	for (int i = 1; i <= pos0[1] + pos0[2] + pos0[3] + pos0[4]; ++i) {
		ld p1 = p[1][pos1[1]], p2 = p[2][pos1[2]] / 2.0, p3 = p[3][pos1[3]] / 3.0, p4 = p[4][pos1[4]] / 4.0;
		if (p1 >= p2 && p1 >= p3 && p1 >= p4) {
			++pos1[1];
		} else if (p2 >= p3 && p2 >= p4) {
			++pos1[2];
		} else if (p3 >= p4) {
			++pos1[3];
		} else {
			++pos1[4];
		}
		solve();
	}
	cout << ans + x0 << "\n";
	return 0;
}