#include<iostream>
#include<iomanip>
#include<algorithm>
using namespace std;
int main(){
int T,size,index,i,key,count=0;
cin>>T;
while(T){
cin>>size;
int a[size];
for(i=0;i<size;i++)
cin>>a[i];
cin>>index;
key=a[index-1];
sort(a,a+size);
for(i=0;i<size;i++)
{
if(key>a[i])
count++;
else
break;
}
cout<<count+1<<endl;
T--;
}
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGlvbWFuaXA+CiNpbmNsdWRlPGFsZ29yaXRobT4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpewoKaW50IFQsc2l6ZSxpbmRleCxpLGtleSxjb3VudD0wOwpjaW4+PlQ7CndoaWxlKFQpewogIGNpbj4+c2l6ZTsKICBpbnQgYVtzaXplXTsKICBmb3IoaT0wO2k8c2l6ZTtpKyspCiAgY2luPj5hW2ldOwogIGNpbj4+aW5kZXg7CiAga2V5PWFbaW5kZXgtMV07CiAgc29ydChhLGErc2l6ZSk7CiAgZm9yKGk9MDtpPHNpemU7aSsrKQogIHsKICAgIGlmKGtleT5hW2ldKQogICAgY291bnQrKzsKICAgIGVsc2UKICAgIGJyZWFrOwogIH0KICBjb3V0PDxjb3VudCsxPDxlbmRsOwogIFQtLTsKfQogIHJldHVybiAwOwp9