// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
// mt19937 mrand(random_device{}());
// int rnd(int x) { return mrand() % x; }
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
int lg2(int64 x) { return sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int64 n, m;
  cin >> n >> m;
  int64 base = m % 5;
  m /= 5;
  vector<vector<int64>> a(5), pre(5);
  for (int i = 0; i < n; ++i) {
    int w, v;
    cin >> w;
    v = (w + 4) / 5 * 5 - w;
    w = (w + 4) / 5;
    a[v].push_back(w);
    trace(m, w, v);
  }
  trace(a);
  for (int i = 1; i < 5; ++i) {
    sort(a[i].begin(), a[i].end());
    pre[i].resize(SZ(a[i]) + 1);
    for (int j = 0; j < SZ(a[i]); ++j) pre[i][j + 1] = pre[i][j] + a[i][j];
  }
  int64 ret = 0;
  for (int x = 0; x < 12 && x <= SZ(a[1]); ++x) {
    for (int y = 0; y < 6 && y <= SZ(a[2]); ++y) {
      for (int z = 0; z < 4 && z <= SZ(a[3]); ++z) {
        for (int t = 0; t < 3 && t <= SZ(a[4]); ++t) {
          trace(x, y, z, t);
          int64 sum = pre[1][x] + pre[2][y] + pre[3][z] + pre[4][t];
          int64 cur = 1 * x + 2 * y + 3 * z + 4 * t;
          vector<int> pos = {0, x, y, z, t};
          while (sum <= m) {
            trace(sum, cur, m);
            ckmax(ret, cur);
            int64 best_w = inf<int64>, best_k = -1;
            for (int k = 1; k <= 4; ++k) {
              if (pos[k] + 12 / k <= SZ(a[k])) {
                int64 w = pre[k][pos[k] + 12 / k] - pre[k][pos[k]];
                if (best_w > w) {
                  best_w = w;
                  best_k = k;
                }
              }
            }
            sum += best_w;
            pos[best_k] += 12 / best_k;
            cur += 12;
          }
        }
      }
    }
  }
  ret += base;
  cout << ret << '\n';
  return 0;
}