10TEL qt

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define rt return
#define MAXN 5000007
int all[MAXN],l[MAXN],r[MAXN],mid[MAXN],n,k;
bool s[MAXN];
signed solve(){
	for(int i=0;i<n;i++){
		cin>>all[i];
		if(i%2==0) l[i]=all[i];//分成两堆 
		else r[i]=all[i];
	}
	for(int i=0;i<n-1;i++){
		if(r[i]>r[i]+1) swap(r[i],r[i+1]);
		if(l[i]>l[i]+1) swap(l[i],l[i+1]);//排序 
	}
	for(int i=0;i<n;i++){
		if((r[i]>l[i])&&s[i]==false){
			swap(r[i],l[i]);
			mid[i]=r[i];
			mid[i+1]=l[i];//存进mid数组 
			s[i]=true;
			s[i+1]=true;
		}
	}
	printf("%ld",mid[k]);
}
int main(){
	cin>>n>>k;
	solve();
	rt 0;
}