#include <bits/stdc++.h>

using namespace std;


int p;
int main()
{
    int T,n,m;
    cin >> T;
    while (T--){
        multiset<long long> s;
        multiset<long long>::iterator it;
        cin.ignore();
        cin >> n >> m;
        long long num[n];
        int turn[m];
        for (int i=0; i<n; i++){
            cin >> num[i];
        }
        int j=0,counter=0;
                if (p){
                    cout << '\n';
                }
        for (int i=0; i<m; i++){
            cin >> turn[i];
            while (j < n && s.size() < turn[i]){
                    s.insert(num[j]);
                    j++;
            }
            it=s.begin();
            for (int k=0; k<counter; k++){
                it++;
            }
            cout << *it << endl;
            counter++;
        }
        p++;
    }
    return 0;
}