#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N >> S; vector a(N); REP(i,N){ cin >> a[i]; } sort(a.begin(),a.end()); if(a[N-1]>=S){ cout << a[N-1] << endl; return 0; } ll p=-1; S--; for(i=N-1;i>=0;i--){ if(a[i]<=S){ S-=a[i]; } else{ p=i; break; } } if(p==-1){ cout << 1 << endl; return 0; } cout << a[p] << endl; return 0; }