#include<bits/stdc++.h>

using namespace std;

int find(int a[], int left, int right, int x)
    { 
        if (left > right) return -1;
        int mid = (left + right) / 2;
        if (x == a[mid]) 
            return mid;
        if (x < a[mid]) 
            return find(a, left , mid-1, x);
        if (x > a[mid]) 
            return find(a, mid+1 , right, x);
    }
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int a[100]={0}, n,k,res;
		cin>>n>>k;
		for(int i=1;i<=n;i++)
		cin>>a[i];
		int left =1,right=n;
		res=find(a,left,right,k);
		if(res==-1) cout <<"NO"<<endl;
		else cout <<res<<endl;
	}
	return 0;
}