#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
using mint=modint998244353;
// g++ a.cpp -std=c++23 -I.
// g++ -std=c++23 -I. a.cpp -o main
// g++ -std=c++23 -I. anaive.cpp -o naive
// g++ -std=c++23 -I. agene.cpp -o gene



int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n;
    cin>>n;
    ll s;
    cin>>s;
    vl z(n);
    rep(i,0,n)cin>>z[i];
    sort(all(z));
    if(z[n-1]>=s){
        cout<<z[n-1]<<endl;
        return 0;
    }
    //cout<<z[n-1]<<endl;
    ll ok=z[n-1];
    ll ng=0;
    reverse(all(z));
    while(ok-ng>1){
        ll mid=(ok+ng)/2;
        ll nows=s;
        ll nd=0;
        ll e=0;
        rep(i,0,n){
            if(nd==0){
                if(nows<=z[i]){
                    if(mid<z[i])e=1;
                }
                else nows-=z[i];
                nd+=mid;
            }
            nd--;
        }
        if(e==0)ok=mid;
        else ng=mid;
    }
    cout<<ok<<endl;
}