#include <bits/stdc++.h>
#define MayaZayn ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define all_r(x) (x).rbegin(), (x).rend()
#define mnEl(vec) *min_element(vec.begin(), vec.end())
#define mxEl(vec) *max_element(vec.begin(), vec.end())
#define yes cout << "YES"
#define no cout << "NO"
#define in(v) for (auto & x : v) cin >> x
#define out(v) for (auto & x : v) cout << x << ' '
#define inLL(v) for (ll & x : v) cin >> x
#define openIn(x) freopen(x, "r", stdin);
#define openOut(x) freopen(x, "w", stdout);
#define M 1000000007
#define N 25005

using namespace std;

int dp[55][N][55], n, lph;
vector<int> v;

int rec(int i, int sum, int cnt) {
    if (sum >= 0 && i == n)
        return cnt;
    if (sum < 0)
        return INT_MIN;

    int &ret = dp[i][sum][cnt];
    if (~ret)
        return ret;

    ret = 0;
    ret = max({rec(i + 1, sum, cnt), rec(i + 1, sum - v[i], cnt + 1), ret});

    return ret;
}

void solve() {
    memset(dp, -1, sizeof dp);
    cin >> n >> lph;
    v.resize(n);
    in(v);
    cout << rec(0, lph*5, 0);
}

int main() {
    MayaZayn

//    int t;
//    cin >> t;
//    while (t--)
        solve();

    return 0;
}