// BINARY SEARCH

#include <iostream>
using namespace std;

int main() {
int t;
cin>>t;
while(t--){
int n,beg,mid,last,x;
cin>>n>>x;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
beg=0;
last=n-1;
mid=(beg+last)/2;
while((beg<=last) && arr[mid]!=x) {
if(x<arr[mid]){
last=mid-1;
mid=(beg+last)/2;
}
else if(x>arr[mid]){
beg=mid+1;
mid=(beg+last)/2;
}
}
if(beg>last){
cout<<"Element doesn't exist"<<endl;
}
else
cout<<mid+1<<endl;
}
return 0;
}