#include <bits/stdc++.h>
#define int long long
#define endl "\n"

using namespace std;

const int N = 2e5;

typedef long long LL;
typedef pair<int, int> PII;

LL d[N];

void solve() {
	LL n,m;
	cin>>n>>m;
	LL m2=m;
	for(LL i=1;i<=n;++i){
		cin>>d[i];
	}
	sort(d+1,d+n+1);
	LL ans=0;
	for(LL i=1;i<=n;++i){
		LL data=(m%i!=0)+m/i;
		if(data>=d[i]){
			m-=d[i];
		}else{
			ans=i-1;
			break;
		}
	}
	if(!n) ans=n;
	LL cnt=1;
	m=m2;
	for(LL i=n;i;--i){
		LL data=(m%cnt!=0)+m/cnt;
		if(data>=d[i]){
			m-=d[i];
			++cnt;
		}
	}
	ans=min(ans,cnt-1);
	cout<<ans<<endl;
}

signed main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	cout.tie(0);
	
	int t = 1;
	// cin >> t;
	while(t--) {
		solve();
	}
}