#include <bits/stdc++.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,ll> P;
typedef pair<ll,P> PP;

//-----------------------------------------------------------------------------

int n,m;
ll a[100000];

bool ok(int i) {
	int l=1,r=n-1,cnt=0;
	while(l<r) {
		if(l==i) {
			l++;
			continue;
		}
		while(l<r-1&&a[l]+a[r]<a[0]+a[i]) {
			r--;
			if(r==i) r--;
		}
		if(l<r&&a[l]+a[r]>a[i]+a[0]) cnt++;
		l++,r--;
	}
	//cout<<"i="<<i<<",cnt="<<cnt<<endl;
	return cnt<m;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n>>m;
	REP(i,n) cin>>a[i];
	sort(a+1,a+n,greater<int>());

	ll ans=INF;
	FOR(i,1,n) {
		if(ok(i)) {
			ans=min(ans,a[i]);
		}
	}
	if(ans==INF) ans=-1;
	cout<<ans<<endl;

	return 0;
}