#include<bits/stdc++.h>
using namespace std;
int n;
long long r,h,t;;
long long x[1005],y[1005],z[1005];
int f[1005],tp[1005],lt[1005];
bool dist(int i,int j){
	long long h,zz,g;
	h=(x[i]-x[j])*(x[i]-x[j]);
	zz=(y[i]-y[j])*(y[i]-y[j]);
	g=(z[i]-z[j])*(z[i]-z[j]);
	if(h+zz>4*r*r) return false;
	if(h+g>4*r*r) return false;
	if(g+zz>4*r*r) return false;
	if(h+zz+g<=4*r*r) return true;
	return false;
}
int find(int x){
	return f[x]==x?x:f[x]=find(f[x]);
}
void merge(int a,int b){
	int g1=find(a),g2=find(b);
	if(g1!=g2) f[a]=b;
}
int main(){
	cin>>t;
	while(t--){
		scanf("%d%lld%lld",&n,&h,&r);
		int sd=0,xd=0;
		for(int i=1;i<=n;i++){
			scanf("%lld%lld%lld",&x[i],&y[i],&z[i]);
			f[i]=i;
			if(z[i]+r>=h){
				tp[++sd]=i;
			}else if(z[i]-r<=0){
				lt[++xd]=i;
			}
			for(int j=1;j<i;j++){
				if(dist(i,j)){
					merge(i,j);
				}
			}
		}
		bool vis=false;
		for(int i=1;i<=sd;i++){
			for(int j=1;j<=xd;j++){
				if(find(tp[i])==find(lt[j])){
					cout<<"Yes"<<endl;
					vis=true;
				}
			}
			if(vis) break;
		}
		if(vis) continue;
		cout<<"No"<<endl;
	}
	
	return 0;
}