#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main() {
int t = 0, n = 0, k = 0,i=0,value = 0;
scanf("%d", &t);
while(t--){
priority_queue < int > down;
priority_queue <int, vector<int>, greater<int> > up;
scanf("%d%d",&k,&n);
for(i = 1;i <= n;i++){
scanf("%d",&value);
if(i < k){
up.push(value);
printf("-1\n");
}
else if(i == k){
up.push(value);
printf("%d\n",up.top());
}
else{
down.push(value);
if(up.top() < down.top()){
int uptop = up.top();
up.pop();
up.push(down.top());
down.pop();
down.push(uptop);
}
printf("%d\n",up.top());
}
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNpbmNsdWRlIDxhbGdvcml0aG0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkgewogICAgaW50IHQgPSAwLCBuID0gMCwgayA9IDAsaT0wLHZhbHVlID0gMDsKICAgIHNjYW5mKCIlZCIsICZ0KTsKICAgIHdoaWxlKHQtLSl7CiAgICAJcHJpb3JpdHlfcXVldWUgPCBpbnQgPiBkb3duOwogICAgCXByaW9yaXR5X3F1ZXVlIDxpbnQsIHZlY3RvcjxpbnQ+LCBncmVhdGVyPGludD4gPiB1cDsKICAgICAgICBzY2FuZigiJWQlZCIsJmssJm4pOwogICAgICAgIGZvcihpID0gMTtpIDw9IG47aSsrKXsKICAgICAgICAJc2NhbmYoIiVkIiwmdmFsdWUpOwogICAgICAgIAlpZihpIDwgayl7CiAgICAgICAgCQl1cC5wdXNoKHZhbHVlKTsKICAgICAgICAJCXByaW50ZigiLTFcbiIpOwoJCQl9CQoJCQllbHNlIGlmKGkgPT0gayl7CgkJCQl1cC5wdXNoKHZhbHVlKTsKICAgICAgICAJCXByaW50ZigiJWRcbiIsdXAudG9wKCkpOwoJCQl9CiAgICAgICAgCWVsc2V7CiAgICAgICAgCQlkb3duLnB1c2godmFsdWUpOwogICAgICAgIAkJaWYodXAudG9wKCkgPCBkb3duLnRvcCgpKXsKICAgICAgICAJCQlpbnQgdXB0b3AgPSB1cC50b3AoKTsKICAgICAgICAJCQl1cC5wb3AoKTsKICAgICAgICAJCQl1cC5wdXNoKGRvd24udG9wKCkpOwogICAgICAgIAkJCWRvd24ucG9wKCk7CiAgICAgICAgCQkJZG93bi5wdXNoKHVwdG9wKTsKCQkJCX0KCQkJCXByaW50ZigiJWRcbiIsdXAudG9wKCkpOwoJCQl9CQoJCX0KICAgICAgICAKICAgIH0KICAKCXJldHVybiAwOwp9