#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define ull unsigned long long
#define sort stable_sort 
#define endl '\n'
int a[200010];
priority_queue<int,vector<int>,less<int> >q1;
priority_queue<int,vector<int>,greater<int> >q2;
int main()
{
// #define Isaac
#ifdef Isaac
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	int t,n,x,i,j;
	cin>>t;
	for(j=1;j<=t;j++)
	{
		cin>>n>>x;
		while(q1.empty()==0)
		{
			q1.pop();
		}
		while(q2.empty()==0)
		{
			q2.pop();
		}
		for(i=1;i<=n;i++)
		{
			cin>>a[i];
			if(abs(i-x)<=1)
			{
				q1.push(a[i]);
			}
			else
			{
				q2.push(a[i]);
			}
		}
		sort(a+1,a+1+n);
		if(n<=4)
		{
			cout<<a[min(3,n)]<<endl;
		}
		else
		{
			if(q1.top()>q2.top())
			{
				q1.push(q2.top());
				q2.pop();
				q2.push(q1.top());
				q1.pop();
			}
			cout<<(q1.size()==2?max(q1.top(),q2.top()):q1.top())<<endl;
		}
	}
	return 0;
}