#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n; LL m;
    cin >> n >> m;
    vector<LL> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());
    auto check = [&](int mid){
        LL t = a[mid - 1] - 1;
        LL last = 0;
        for(int i = 0; i + 1 < mid; i++){
            last += t + a[i];
            if (last >= m) return false;
        }
        return last + a[mid - 1] <= m;
    };

    int l = 0, r = n;
    while(l < r){
        int mid = (l + r + 1) / 2;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << r << '\n';

}