#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=5e5+3;
int n,m,ny[N];
ll K;
pii a[N];
bool vis[N];
int _;
namespace SGT{
	int X;
	const int M=1<<20;
	int L[M],R[M],pl[M],pr[M],tl[M],tr[M],tg1[M],tg2[M],d[M];
	ll mx1[M],mx2[M];
#define m ((l+r)>>1)
#define ls x<<1
#define rs x<<1|1
	inline void pu(int x){
		if(pl[ls]!=INT_MAX)pl[x]=pl[ls],L[x]=L[ls];
		else pl[x]=pl[rs],L[x]=L[rs];
		if(pr[rs])pr[x]=pr[rs],R[x]=R[rs];
		else pr[x]=pr[ls],R[x]=R[ls];
		tl[x]=min(tl[ls],tl[rs]),tr[x]=max(tr[ls],tr[rs]);
		d[x]=max(d[ls],d[rs]);
		if(tl[rs]!=INT_MAX&&tr[ls])d[x]=max(d[x],ny[tl[rs]]-ny[tr[ls]]);
		mx1[x]=max(mx1[ls],mx1[rs]);
		if(R[rs]&&R[ls]<R[rs])mx2[x]=mx2[rs];
		else mx2[x]=max(mx2[ls],mx2[rs]);
	}
	inline void ad1(int x,int k){
		if(!R[x])return;tg1[x]=k;
		L[x]=R[x]=k;
		mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
	}
	inline void ad2(int x,int k){
		if(!tr[x])return;tg2[x]=k,tg1[x]=0;
		if(k){
			L[x]=R[x]=k;pl[x]=tl[x],pr[x]=tr[x];
			mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
		}
		else{
			L[x]=pl[x]=INT_MAX,R[x]=pr[x]=0;
			mx1[x]=mx2[x]=0;
		}
	}
	inline void pd(int x){
		if(~tg2[x]){
			ad2(ls,tg2[x]),ad2(rs,tg2[x]);
			tg2[x]=-1;
		}
		if(tg1[x]){
			ad1(ls,tg1[x]),ad1(rs,tg1[x]);
			tg1[x]=0;
		}
	}
	inline void bd(int x,int l,int r){
		L[x]=pl[x]=tl[x]=INT_MAX,R[x]=pr[x]=tr[x]=0,tg1[x]=0,tg2[x]=-1,mx1[x]=mx2[x]=0,d[x]=0;
		if(l==r)return;bd(ls,l,m),bd(rs,m+1,r);
	}
	inline void get(int x,int l,int r,int nx,bool fl){
		if(l==r){
			vis[l]=1;tl[x]=tr[x]=l;
			if(fl){
				L[x]=R[x]=X,mx1[x]=ny[l]+X,mx2[x]=mx1[x]+ny[l];
				pl[x]=pr[x]=l;
			}
			return;
		}pd(x);
		if(nx<=m)get(ls,l,m,nx,fl);
		else get(rs,m+1,r,nx,fl);
		pu(x);
	}
	inline bool ck2(int x){return X+2ll*x<=K;}
	int lst2;
	inline void upd2(int x,int l,int r,int nl){
		if(r<nl||!tr[x]||!ck2(ny[tl[x]]-lst2))return;
		if(l>=nl&&ck2(d[x])&&ck2(ny[tl[x]]-lst2)){ad2(x,X),lst2=ny[tr[x]];return;}
		if(l==r)return;
		pd(x);upd2(ls,l,m,nl),upd2(rs,m+1,r,nl);pu(x);
	}
	int lst;
	inline bool ck(int x,int y){return 2ll*(X-x)+ny[y]<=K; }
	inline void upd1(int x,int l,int r,int nl){
		if(r<nl||!pr[x])return;
		if(l>=nl && L[x]==R[x] && ck(L[x],pl[x])==ck(R[x],pr[x])){
			if(ck(L[x],pl[x])){
				bool fl=0;
				if(lst!=L[x])lst=L[x],fl=1;
				ad1(x,X);
				if(fl&&pr[x]<_)lst2=ny[pr[x]],upd2(1,1,_,pr[x]+1);
			}
			else ad2(x,0);
			return ;
		}
		if(l==r)return;
		pd(x),upd1(rs,m+1,r,nl),upd1(ls,l,m,nl),pu(x);
	}
	ll lim;
	inline bool qr(int x,int l,int r,int nr){
		if(l>nr)return 0;
		if(r<=nr){
			if(lim-mx1[x]<=K)return 1;
			if(R[x]==X&&lim-mx2[x]<=K)return 1;
			return 0;
		}
		pd(x);return qr(ls,l,m,nr)|qr(rs,m+1,r,nr);
	}
	inline int qmx(int x,int l,int r,int nl){
		if(r<nl)return 0; if(l>=nl)return L[x];
		pd(x);return max(qmx(ls,l,m,nl),qmx(rs,m+1,r,nl));
	}
#undef m
}
using namespace SGT;
inline void solve(int test){
	n=read(),K=read();
	rep(i,1,n)a[i].fi=read(),ny[i]=a[i].se=read();
	sort(a+1,a+n+1);
	sort(ny+1,ny+n+1);_=m=unique(ny+1,ny+n+1)-ny-1;
	rep(i,1,n)a[i].se=lower_bound(ny+1,ny+m+1,a[i].se)-ny;
	bd(1,1,m);
	rep(i,1,m)vis[i]=0;
	for(int L=1,R;L<=n;L=R){
		for(R=L;R<=n&&a[L].fi==a[R].fi;++R);
		X=a[L].fi;
		lst=-1;upd1(1,1,m,a[L].se);
		rep(i,L,R-1)if(!vis[a[i].se]){
			lim=2ll*(ny[a[i].se]+X);
			bool fl=(lim<=K)|qr(1,1,m,a[i].se-1);
			get(1,1,m,a[i].se,fl);
			if(fl&&a[i].se<m) lst2=ny[a[i].se],upd2(1,1,m,a[i].se+1);
		}
	}
	if(qmx(1,1,m,m)==a[n].fi)printf("Yes\n");
	else printf("No\n");
}
int main() {
	int T=read();rep(i,1,T)solve(i);
    return 0;
}

/*#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=5e5+3;
int n,m,ny[N];
ll K;
pii a[N];
bool vis[N];
int _;
namespace SGT{
	int X;
	const int M=1<<20;
	int L[M],R[M],pl[M],pr[M],tl[M],tr[M],tg1[M],tg2[M],d[M];
	ll mx1[M],mx2[M];
#define m ((l+r)>>1)
#define ls x<<1
#define rs x<<1|1
	inline void pu(int x){
		if(pl[ls]!=INT_MAX)pl[x]=pl[ls],L[x]=L[ls];
		else pl[x]=pl[rs],L[x]=L[rs];
		if(pr[rs])pr[x]=pr[rs],R[x]=R[rs];
		else pr[x]=pr[ls],R[x]=R[ls];
		tl[x]=min(tl[ls],tl[rs]),tr[x]=max(tr[ls],tr[rs]);
		d[x]=max(d[ls],d[rs]);
		if(tl[rs]!=INT_MAX&&tr[ls])d[x]=max(d[x],ny[tl[rs]]-ny[tr[ls]]);
		mx1[x]=max(mx1[ls],mx1[rs]);
		if(R[rs]&&R[ls]<R[rs])mx2[x]=mx2[rs];
		else mx2[x]=max(mx2[ls],mx2[rs]);
	}
	inline void ad1(int x,int k){
		if(!R[x])return;tg1[x]=k;
		L[x]=R[x]=k;
		mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
	}
	inline void ad2(int x,int k){
		if(!tr[x])return;tg2[x]=k,tg1[x]=0;
		if(k){
			L[x]=R[x]=k;pl[x]=tl[x],pr[x]=tr[x];
			mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
		}
		else{
			L[x]=pl[x]=INT_MAX,R[x]=pr[x]=0;
			mx1[x]=mx2[x]=0;
		}
	}
	inline void pd(int x){
		if(~tg2[x]){
			ad2(ls,tg2[x]),ad2(rs,tg2[x]);
			tg2[x]=-1;
		}
		if(tg1[x]){
			ad1(ls,tg1[x]),ad1(rs,tg1[x]);
			tg1[x]=0;
		}
	}
	inline void bd(int x,int l,int r){
		L[x]=pl[x]=tl[x]=INT_MAX,R[x]=pr[x]=tr[x]=0,tg1[x]=0,tg2[x]=-1,mx1[x]=mx2[x]=0,d[x]=0;
		if(l==r)return;bd(ls,l,m),bd(rs,m+1,r);
	}
	inline void get(int x,int l,int r,int nx,bool fl){
		if(l==r){
			vis[l]=1;tl[x]=tr[x]=l;
			if(fl){
				L[x]=R[x]=X,mx1[x]=ny[l]+X,mx2[x]=mx1[x]+ny[l];
				pl[x]=pr[x]=l;
			}
			return;
		}pd(x);
		if(nx<=m)get(ls,l,m,nx,fl);
		else get(rs,m+1,r,nx,fl);
		pu(x);
	}
	inline bool ck2(int x){return X+2ll*x<=K;}
	int lst2;
	inline void upd2(int x,int l,int r,int nl){
		if(r<nl||!tr[x]||!ck2(ny[tl[x]]-lst2))return;
		if(l>=nl&&ck2(d[x])&&ck2(ny[tl[x]]-lst2)){ad2(x,X),lst2=ny[tr[x]];return;}
		if(l==r)return;
		pd(x);upd2(ls,l,m,nl),upd2(rs,m+1,r,nl);pu(x);
	}
	int lst;
	inline bool ck(int x,int y){return 2ll*(X-x)+ny[y]<=K; }
	inline void upd1(int x,int l,int r,int nl){
		if(r<nl||!pr[x])return;
		if(l>=nl && L[x]==R[x] && ck(L[x],pl[x])==ck(R[x],pr[x])){
			if(ck(L[x],pl[x])){
				bool fl=0;
				if(lst!=L[x])lst=L[x],fl=1;
				ad1(x,X);
				if(fl&&pr[x]<_)lst2=ny[pr[x]],upd2(1,1,_,pr[x]+1);
			}
			else ad2(x,0);
			return ;
		}
		if(l==r)return;
		pd(x),upd1(rs,m+1,r,nl),upd1(ls,l,m,nl),pu(x);
	}
	ll lim;
	inline bool qr(int x,int l,int r,int nr){
		if(l>nr)return 0;
		if(r<=nr){
			if(lim-mx1[x]<=K)return 1;
			if(R[x]==X&&lim-mx2[x]<=K)return 1;
			return 0;
		}
		pd(x);return qr(ls,l,m,nr)|qr(rs,m+1,r,nr);
	}
	inline int qmx(int x,int l,int r,int nl){
		if(r<nl)return 0; if(l>=nl)return L[x];
		pd(x);return max(qmx(ls,l,m,nl),qmx(rs,m+1,r,nl));
	}
#undef m
}
using namespace SGT;
inline void solve(int test){
	n=read(),K=read();
	rep(i,1,n)a[i].fi=read(),ny[i]=a[i].se=read();
	sort(a+1,a+n+1);
	sort(ny+1,ny+n+1);_=m=unique(ny+1,ny+n+1)-ny-1;
	rep(i,1,n)a[i].se=lower_bound(ny+1,ny+m+1,a[i].se)-ny;
	bd(1,1,m);
	rep(i,1,m)vis[i]=0;
	for(int L=1,R;L<=n;L=R){
		for(R=L;R<=n&&a[L].fi==a[R].fi;++R);
		X=a[L].fi;
		lst=-1;upd1(1,1,m,a[L].se);
		rep(i,L,R-1)if(!vis[a[i].se]){
			lim=2ll*(ny[a[i].se]+X);
			bool fl=(lim<=K)|qr(1,1,m,a[i].se-1);
			get(1,1,m,a[i].se,fl);
			if(fl&&a[i].se<m) lst2=ny[a[i].se],upd2(1,1,m,a[i].se+1);
		}
	}
	if(qmx(1,1,m,m)==a[n].fi)printf("Yes\n");
	else printf("No\n");
}
int main() {
	int T=read();rep(i,1,T)solve(i);
    return 0;
}
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=5e5+3;
int n,m,ny[N];
ll K;
pii a[N];
bool vis[N];
int _;
namespace SGT{
	int X;
	const int M=1<<20;
	int L[M],R[M],pl[M],pr[M],tl[M],tr[M],tg1[M],tg2[M],d[M];
	ll mx1[M],mx2[M];
#define m ((l+r)>>1)
#define ls x<<1
#define rs x<<1|1
	inline void pu(int x){
		if(pl[ls]!=INT_MAX)pl[x]=pl[ls],L[x]=L[ls];
		else pl[x]=pl[rs],L[x]=L[rs];
		if(pr[rs])pr[x]=pr[rs],R[x]=R[rs];
		else pr[x]=pr[ls],R[x]=R[ls];
		tl[x]=min(tl[ls],tl[rs]),tr[x]=max(tr[ls],tr[rs]);
		d[x]=max(d[ls],d[rs]);
		if(tl[rs]!=INT_MAX&&tr[ls])d[x]=max(d[x],ny[tl[rs]]-ny[tr[ls]]);
		mx1[x]=max(mx1[ls],mx1[rs]);
		if(R[rs]&&R[ls]<R[rs])mx2[x]=mx2[rs];
		else mx2[x]=max(mx2[ls],mx2[rs]);
	}
	inline void ad1(int x,int k){
		if(!R[x])return;tg1[x]=k;
		L[x]=R[x]=k;
		mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
	}
	inline void ad2(int x,int k){
		if(!tr[x])return;tg2[x]=k,tg1[x]=0;
		if(k){
			L[x]=R[x]=k;pl[x]=tl[x],pr[x]=tr[x];
			mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
		}
		else{
			L[x]=pl[x]=INT_MAX,R[x]=pr[x]=0;
			mx1[x]=mx2[x]=0;
		}
	}
	inline void pd(int x){
		if(~tg2[x]){
			ad2(ls,tg2[x]),ad2(rs,tg2[x]);
			tg2[x]=-1;
		}
		if(tg1[x]){
			ad1(ls,tg1[x]),ad1(rs,tg1[x]);
			tg1[x]=0;
		}
	}
	inline void bd(int x,int l,int r){
		L[x]=pl[x]=tl[x]=INT_MAX,R[x]=pr[x]=tr[x]=0,tg1[x]=0,tg2[x]=-1,mx1[x]=mx2[x]=0,d[x]=0;
		if(l==r)return;bd(ls,l,m),bd(rs,m+1,r);
	}
	inline void get(int x,int l,int r,int nx,bool fl){
		if(l==r){
			vis[l]=1;tl[x]=tr[x]=l;
			if(fl){
				L[x]=R[x]=X,mx1[x]=ny[l]+X,mx2[x]=mx1[x]+ny[l];
				pl[x]=pr[x]=l;
			}
			return;
		}pd(x);
		if(nx<=m)get(ls,l,m,nx,fl);
		else get(rs,m+1,r,nx,fl);
		pu(x);
	}
	inline bool ck2(int x){return X+2ll*x<=K;}
	int lst2;
	inline void upd2(int x,int l,int r,int nl){
		if(r<nl||!tr[x]||!ck2(ny[tl[x]]-lst2))return;
		if(l>=nl&&ck2(d[x])&&ck2(ny[tl[x]]-lst2)){ad2(x,X),lst2=ny[tr[x]];return;}
		if(l==r)return;
		pd(x);upd2(ls,l,m,nl),upd2(rs,m+1,r,nl);pu(x);
	}
	int lst;
	inline bool ck(int x,int y){return 2ll*(X-x)+ny[y]<=K; }
	inline void upd1(int x,int l,int r,int nl){
		if(r<nl||!pr[x])return;
		if(l>=nl && L[x]==R[x] && ck(L[x],pl[x])==ck(R[x],pr[x])){
			if(ck(L[x],pl[x])){
				bool fl=0;
				if(lst!=L[x])lst=L[x],fl=1;
				ad1(x,X);
				if(fl&&pr[x]<_)lst2=ny[pr[x]],upd2(1,1,_,pr[x]+1);
			}
			else ad2(x,0);
			return ;
		}
		if(l==r)return;
		pd(x),upd1(rs,m+1,r,nl),upd1(ls,l,m,nl),pu(x);
	}
	ll lim;
	inline bool qr(int x,int l,int r,int nr){
		if(l>nr)return 0;
		if(r<=nr){
			if(lim-mx1[x]<=K)return 1;
			if(R[x]==X&&lim-mx2[x]<=K)return 1;
			return 0;
		}
		pd(x);return qr(ls,l,m,nr)|qr(rs,m+1,r,nr);
	}
	inline int qmx(int x,int l,int r,int nl){
		if(r<nl)return 0; if(l>=nl)return L[x];
		pd(x);return max(qmx(ls,l,m,nl),qmx(rs,m+1,r,nl));
	}
#undef m
}
using namespace SGT;
inline void solve(int test){
	n=read(),K=read();
	rep(i,1,n)a[i].fi=read(),ny[i]=a[i].se=read();
	sort(a+1,a+n+1);
	sort(ny+1,ny+n+1);_=m=unique(ny+1,ny+n+1)-ny-1;
	rep(i,1,n)a[i].se=lower_bound(ny+1,ny+m+1,a[i].se)-ny;
	bd(1,1,m);
	rep(i,1,m)vis[i]=0;
	for(int L=1,R;L<=n;L=R){
		for(R=L;R<=n&&a[L].fi==a[R].fi;++R);
		X=a[L].fi;
		lst=-1;upd1(1,1,m,a[L].se);
		rep(i,L,R-1)if(!vis[a[i].se]){
			lim=2ll*(ny[a[i].se]+X);
			bool fl=(lim<=K)|qr(1,1,m,a[i].se-1);
			get(1,1,m,a[i].se,fl);
			if(fl&&a[i].se<m) lst2=ny[a[i].se],upd2(1,1,m,a[i].se+1);
		}
	}
	if(qmx(1,1,m,m)==a[n].fi)printf("Yes\n");
	else printf("No\n");
}
int main() {
	int T=read();rep(i,1,T)solve(i);
    return 0;
}
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=5e5+3;
int n,m,ny[N];
ll K;
pii a[N];
bool vis[N];
int _;
namespace SGT{
	int X;
	const int M=1<<20;
	int L[M],R[M],pl[M],pr[M],tl[M],tr[M],tg1[M],tg2[M],d[M];
	ll mx1[M],mx2[M];
#define m ((l+r)>>1)
#define ls x<<1
#define rs x<<1|1
	inline void pu(int x){
		if(pl[ls]!=INT_MAX)pl[x]=pl[ls],L[x]=L[ls];
		else pl[x]=pl[rs],L[x]=L[rs];
		if(pr[rs])pr[x]=pr[rs],R[x]=R[rs];
		else pr[x]=pr[ls],R[x]=R[ls];
		tl[x]=min(tl[ls],tl[rs]),tr[x]=max(tr[ls],tr[rs]);
		d[x]=max(d[ls],d[rs]);
		if(tl[rs]!=INT_MAX&&tr[ls])d[x]=max(d[x],ny[tl[rs]]-ny[tr[ls]]);
		mx1[x]=max(mx1[ls],mx1[rs]);
		if(R[rs]&&R[ls]<R[rs])mx2[x]=mx2[rs];
		else mx2[x]=max(mx2[ls],mx2[rs]);
	}
	inline void ad1(int x,int k){
		if(!R[x])return;tg1[x]=k;
		L[x]=R[x]=k;
		mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
	}
	inline void ad2(int x,int k){
		if(!tr[x])return;tg2[x]=k,tg1[x]=0;
		if(k){
			L[x]=R[x]=k;pl[x]=tl[x],pr[x]=tr[x];
			mx1[x]=k+ny[pr[x]],mx2[x]=mx1[x]+ny[pr[x]];
		}
		else{
			L[x]=pl[x]=INT_MAX,R[x]=pr[x]=0;
			mx1[x]=mx2[x]=0;
		}
	}
	inline void pd(int x){
		if(~tg2[x]){
			ad2(ls,tg2[x]),ad2(rs,tg2[x]);
			tg2[x]=-1;
		}
		if(tg1[x]){
			ad1(ls,tg1[x]),ad1(rs,tg1[x]);
			tg1[x]=0;
		}
	}
	inline void bd(int x,int l,int r){
		L[x]=pl[x]=tl[x]=INT_MAX,R[x]=pr[x]=tr[x]=0,tg1[x]=0,tg2[x]=-1,mx1[x]=mx2[x]=0,d[x]=0;
		if(l==r)return;bd(ls,l,m),bd(rs,m+1,r);
	}
	inline void get(int x,int l,int r,int nx,bool fl){
		if(l==r){
			vis[l]=1;tl[x]=tr[x]=l;
			if(fl){
				L[x]=R[x]=X,mx1[x]=ny[l]+X,mx2[x]=mx1[x]+ny[l];
				pl[x]=pr[x]=l;
			}
			return;
		}pd(x);
		if(nx<=m)get(ls,l,m,nx,fl);
		else get(rs,m+1,r,nx,fl);
		pu(x);
	}
	inline bool ck2(int x){return X+2ll*x<=K;}
	int lst2;
	inline void upd2(int x,int l,int r,int nl){
		if(r<nl||!tr[x]||!ck2(ny[tl[x]]-lst2))return;
		if(l>=nl&&ck2(d[x])&&ck2(ny[tl[x]]-lst2)){ad2(x,X),lst2=ny[tr[x]];return;}
		if(l==r)return;
		pd(x);upd2(ls,l,m,nl),upd2(rs,m+1,r,nl);pu(x);
	}
	int lst;
	inline bool ck(int x,int y){return 2ll*(X-x)+ny[y]<=K; }
	inline void upd1(int x,int l,int r,int nl){
		if(r<nl||!pr[x])return;
		if(l>=nl && L[x]==R[x] && ck(L[x],pl[x])==ck(R[x],pr[x])){
			if(ck(L[x],pl[x])){
				bool fl=0;
				if(lst!=L[x])lst=L[x],fl=1;
				ad1(x,X);
				if(fl&&pr[x]<_)lst2=ny[pr[x]],upd2(1,1,_,pr[x]+1);
			}
			else ad2(x,0);
			return ;
		}
		if(l==r)return;
		pd(x),upd1(rs,m+1,r,nl),upd1(ls,l,m,nl),pu(x);
	}
	ll lim;
	inline bool qr(int x,int l,int r,int nr){
		if(l>nr)return 0;
		if(r<=nr){
			if(lim-mx1[x]<=K)return 1;
			if(R[x]==X&&lim-mx2[x]<=K)return 1;
			return 0;
		}
		pd(x);return qr(ls,l,m,nr)|qr(rs,m+1,r,nr);
	}
	inline int qmx(int x,int l,int r,int nl){
		if(r<nl)return 0; if(l>=nl)return L[x];
		pd(x);return max(qmx(ls,l,m,nl),qmx(rs,m+1,r,nl));
	}
#undef m
}
using namespace SGT;
inline void solve(int test){
	n=read(),K=read();
	rep(i,1,n)a[i].fi=read(),ny[i]=a[i].se=read();
	sort(a+1,a+n+1);
	sort(ny+1,ny+n+1);_=m=unique(ny+1,ny+n+1)-ny-1;
	rep(i,1,n)a[i].se=lower_bound(ny+1,ny+m+1,a[i].se)-ny;
	bd(1,1,m);
	rep(i,1,m)vis[i]=0;
	for(int L=1,R;L<=n;L=R){
		for(R=L;R<=n&&a[L].fi==a[R].fi;++R);
		X=a[L].fi;
		lst=-1;upd1(1,1,m,a[L].se);
		rep(i,L,R-1)if(!vis[a[i].se]){
			lim=2ll*(ny[a[i].se]+X);
			bool fl=(lim<=K)|qr(1,1,m,a[i].se-1);
			get(1,1,m,a[i].se,fl);
			if(fl&&a[i].se<m) lst2=ny[a[i].se],upd2(1,1,m,a[i].se+1);
		}
	}
	if(qmx(1,1,m,m)==a[n].fi)printf("Yes\n");
	else printf("No\n");
}
int main() {
	int T=read();rep(i,1,T)solve(i);
    return 0;
}
*/