#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

bool solve(){
    ll n, m;
    cin >> n >> m;

    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    for(ll i=0; i<n-1; i++){
        if(a[i]+a[i+1] < m || 2*m < a[i]+a[i+1]){
            return false;
        }
    }

    return true;
}

int main(){
    ll t;
    cin >> t;

    vector<bool> ans(t);
    rep(i, t) ans[i] = solve();
    rep(i, t){
        if(ans[i]) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}