//Ojas Kumar Dubey //
// el_freki //
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define v1 vector<int>
#define mapp map<int,int>
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
int modulo=1000000007;
#define deb(x) cout << #x << "=" << x << endl
#define test int t;cin>>t;while(t--)
#define f(i,j,n) for(int i=j;i<n;i++)
#define r(i,j,n) for(int i=j-1;i>=n;i--)
#define minn INT_MIN
#define maxx INT_MAX
#define all(container) container.begin() , container.end()
#define sz(container) (int)container.size()
#define pii pair <int , int>
#define pll pair <long long int , long long int>
#define setp(x) setprecision(x)
int power(int a,int n){
    
    int var=a,ans=1;
    while(n){
        if(n&1)
            ans=((ans)*(var));
        var=((var)*(var));
        n=n>>1;
    }
    return ans;
}
// ------------------------------------Template End------------------------------ //
void solve(){
    int n,d;
    cin>>n>>d;
    vector<int> a(n);
    bool flag = false;
    for(int i=0;i<n;i++){
      cin>>a[i];
      if(a[i] > d) flag = true;
    }
    sort(a.begin(), a.end());
    if(a[0] + a[1] > d && flag == true) cout<<"NO"<<endl;
    else  cout<<"YES"<<endl;
}
signed main(){
  fast;
    #ifndef ONLINE_JUDGE
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    #endif
  test 
    solve();
}