#include using namespace std; #define all(v) (v).begin(),(v).end() #define pb emplace_back #define rep(i, n) for(int i=0;i<(n);i++) #define foa(e, v) for(auto& e : v) #define dout(a) cout< using pqr = priority_queue, greater>; template inline bool chmax(T1 &a, T2 b) { bool compare = a < b; if(compare) a = b; return compare; } template inline bool chmin(T1 &a, T2 b) { bool compare = a > b; if(compare) a = b; return compare; } template inline T back(std::set &s) { return *s.rbegin(); } template inline T back(std::multiset &s) { return *s.rbegin(); } template inline T pop_back(std::set &s) { auto it = prev(s.end()); T val = *it; s.erase(it); return val; } template inline T pop_back(std::multiset &s) { auto it = prev(s.end()); T val = *it; s.erase(it); return val; } const int dy[8] = {-1, 0, 0, 1, 1, -1, 1, -1}; const int dx[8] = {0, -1, 1, 0, -1, -1, 1, 1}; const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (3LL << 59); const int inf = 1 << 30; const char br = '\n'; void solve() { ll n, s; cin >> n >> s; vector a(n); rep(i, n) cin >> a[i]; sort(all(a)); if(a.back() >= s) { cout << a.back() << endl; return; } ll ans = min(a.back(), n); reverse(all(a)); for(ll i = 1; i <= n; i ++) { ll x = s; for(int j = 0; j < n; j += i) { ll num = 0; x -= a[j]; if(j + i < n) num = a[j + i]; if(x > 0) chmin(ans, max(num, i)); } } // for(int i = n - 1; i >= 0; i --) { // s -= a[i]; // if(s > 0) { // chmin(ans, a[i - 1]); // } else break; // } cout << ans << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); int testcase = 1; // cin >> testcase; while(testcase --) solve(); return 0; }