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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--){
        long long n, x;
        cin >> n >> x;
        vector<long long> a(n);
        for(auto &num: a) cin >> num;
        // Find min_val and its first occurrence
        long long min_val = a[0];
        int min_idx = 0;
        for(int i=1;i<n;i++){
            if(a[i] < min_val){
                min_val = a[i];
                min_idx = i;
            }
        }
        // Swap a[x-1] with a[min_idx] if needed
        if(min_idx != (int)(x-1)){
            swap(a[x-1], a[min_idx]);
        }
        // Collect y = x-1, x, x+1
        // Note: 1-based indexing
        vector<long long> candidates;
        if(x-2 >=0) candidates.push_back(a[x-2]);
        candidates.push_back(a[x-1]);
        if(x < n) candidates.push_back(a[x]);
        // Find the maximum among candidates
        long long ans = *max_element(candidates.begin(), candidates.end());
        cout << ans << "\n";
    }
}