#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n,s;
    cin>>n>>s;
    vector<long long>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    sort(a.rbegin(),a.rend());
    int mx=a[0],mn=1;
    s--;
    while(mx-mn){
        int mid=(mx+mn)/2;
        long long tmp=0;
        for(int i=0;i<n;i+=mid){
            if(a[i]>mid)tmp+=a[i];
        }
        if(tmp<=s){
            mx=mid;
        }else{
            mn=mid+1;
        }
    }
    cout<<mn<<endl;
    return 0;
}