#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[6] = {1, 0, -1, 0, 1, 1};
const int dy[6] = {0, 1, 0, -1, 1, -1};
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int _;
  cin >> _;
  while (_--) {
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    bool can = false;
    for (int i = 0; i < N; i++) {
      cin >> A[i];
      if (A[i] == K) can = true;
    }
    if (!can) {
      cout << "no" << '\n';
      continue;
    }
    if (N == 1) {
      cout << "yes" << '\n';
      continue;
    }
    can = false;
    for (int i = 0; i < N - 1; i++) {
      if (A[i] >= K and A[i + 1] >= K) {
        can = true;
      }
    }
    for (int i = 0; i < N - 2; i++) {
      int cnt = 0;
      for (int j = 0; j < 3; j++) {
        if (A[i + j] >= K) cnt++;
      }
      if (cnt >= 2) {
        can = true;
      }
    }
    if (can) {
      cout << "yes" << '\n';
    } else {
      cout << "no" << '\n';
    }
  }
  return 0;
}
