UVa501

#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

int main()
{
	int t;
	int m, n;

#ifndef ONLINE_JUDGE
	freopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif

	scanf("%d", &t);
	while (t--) {
		scanf("%d%d", &m, &n);

		vector<int> v(m);

		for (int i = 0; i < m; i++) {
			scanf("%d", &v[i]);
		}

		for (int i = 1; i <= n; i++) {
			priority_queue<int> maxHeap;
			priority_queue<int, vector<int>, greater<int> > minHeap;
			int num;
			scanf("%d", &num);

			for (int j = 0; j < num; j++) {
				maxHeap.push(v[j]);
			}

			//printf("111\n");
			while (maxHeap.size() > i - 1) {
				int tmp = maxHeap.top();
				maxHeap.pop();
				minHeap.push(tmp);
			}
			//printf("222\n");
			//printf("size=%d\n", minHeap.size());
			printf("%d\n", minHeap.top());
		}
		if (t) printf("\n");
	}
	return 0;
}