#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
// disable assert
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
template <class T> using V = vector<T>;
template <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }
template <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }


void testcase(){
  ll N, S; cin >> N >> S;
  V<ll> A(N); REP(i,N) cin >> A[i];
  sort(A.rbegin(), A.rend());
  V<ll> sum(N+1);
  REP(i,N) sum[i+1] = sum[i] + A[i];
  ll K = lower_bound(sum.begin(), sum.end(), S) - sum.begin() - 1;
  ll ans = K == N ? 1 : A[K];
  cout << ans << "\n";
}

int main(){
  cin.tie(0)->sync_with_stdio(0);
  testcase();
  return 0;
}