#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, k;
        cin >> n >> k;
        int a[n];
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
 
        sort(a, a + n);
 
        if (binary_search(a, a + n, k)) {
            int pos = lower_bound(a, a + n, k) - a + 1;
            cout << pos << "\n";
        } else {
            cout << "NO\n";
        }
    }
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGxsIGxvbmcgbG9uZwoKaW50IG1haW4oKSB7CiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIGludCBuLCBrOwogICAgICAgIGNpbiA+PiBuID4+IGs7CiAgICAgICAgaW50IGFbbl07CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQogICAgICAgIAogICAgICAgIHNvcnQoYSwgYSArIG4pOwogICAgICAgIAogICAgICAgIGlmIChiaW5hcnlfc2VhcmNoKGEsIGEgKyBuLCBrKSkgewogICAgICAgICAgICBpbnQgcG9zID0gbG93ZXJfYm91bmQoYSwgYSArIG4sIGspIC0gYSArIDE7CiAgICAgICAgICAgIGNvdXQgPDwgcG9zIDw8ICJcbiI7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgY291dCA8PCAiTk9cbiI7CiAgICAgICAgfQogICAgfQp9