#include <bits/stdc++.h>
const int N = 208001;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
using namespace std;
long long cx[4] = {-1, 0, 1, 0};
long long cy[4] = {0, -1, 0, 1};
long long inq(long long x, long long y) {
  if (!y) return 1 % MOD;
  long long l = inq(x, y / 2);
  if (y % 2) return l * l % MOD * x % MOD;
  return l * l % MOD;
}
long long rev(long long x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<long long> __fact, __ufact, __rev;
void __precompute_combinatorics() {
  __precomputed_combinatorics = 1;
  __fact.resize(N);
  __ufact.resize(N);
  __rev.resize(N);
  __rev[1] = 1;
  for (long long i = 2; i < N; i++)
    __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
  __fact[0] = 1, __ufact[0] = 1;
  for (long long i = 1; i < N; i++)
    __fact[i] = __fact[i - 1] * i % MOD,
    __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
long long fact(long long x) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[x];
}
long long cnk(long long n, long long k) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (long long(i) = 0; (i) != (n); (i)++) cin >> a[i];
  long long t = 0;
  for (long long(i) = 0; (i) != (n); (i)++)
    if (a[i] == k) t = 1;
  if (!t) {
    cout << "No\n";
    return;
  }
  if (n == 1) {
    cout << "Yes\n";
    return;
  }
  t = 0;
  for (long long(i) = 0; (i) != (n); (i)++) {
    if (a[i] >= k) {
      if (i - 1 >= 0 && a[i - 1] >= k) t = 1;
      if (i + 1 < n && a[i + 1] >= k) t = 1;
    }
  }
  for (long long(i) = 0; (i) != (n - 2); (i)++) {
    if (a[i] >= k && a[i + 2] >= k) t = 1;
  }
  if (t) {
    cout << "yes\n";
    return;
  }
  for (long long i = 0; i < n; i++) {
    if (a[i] < k)
      a[i] = -1;
    else
      a[i] = 1;
  }
  for (long long(i) = 0; (i) != (n); (i)++)
    if (a[i] == 0) a[i] = 1;
  long long maxsumm = 0, minpref = INF;
  vector<long long> pref(n);
  pref[0] = a[0];
  for (long long i = 1; i < n; i++) pref[i] = pref[i - 1] + a[i];
  for (long long(i) = 0; (i) != (n); (i)++) {
    if (i > 1) minpref = min(minpref, pref[i - 2]);
    maxsumm = max(maxsumm, pref[i] - minpref);
  }
  if (maxsumm > 0) {
    cout << "yEs\n";
  } else {
    cout << "nO\n";
  }
}
signed main() {
  srand(time(NULL));
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  for (long long _ = 1; _ <= t; _++) {
    solve();
  }
}
