#include<bits/stdc++.h>
using namespace std;

#define y1 yy

int t;

inline double dis(int x1,int y1,int z1,int x2,int y2,int z2){
	return sqrt(pow(x1-x2,2)+pow(y1-y2,2)+pow(z1-z2,2));
}
bool bfs(const int& s,const int& e,const int& n,const vector<int>*g){
	bool vis[n+5];
	memset(vis,0,sizeof vis);
	vis[s] = 1;
	queue<int>q;
	q.push(s);
	
	while(q.size()){
		if(q.front() == e)
			return 1;
		
		for(auto& p : g[q.front()]){
			if(!vis[p])
				vis[p] = 1, q.push(p);
		}
		
		q.pop();
	}
	return 0;
}

inline bool solve(){
	int n,h,r;
	cin >> n >> h >> r;
	int a[n+5][3];
	vector<int>g[n+5];
	for(int i = 1; i <= n; i++){
		cin >> a[i][0] >> a[i][1] >> a[i][2];
		if(a[i][2] <= r)
			g[0].push_back(i);
		if(a[i][2] + r >= h)
			g[i].push_back(n+1);
	}
	int r2 = r << 1;
	for(int i = 1; i < n; i++){
		for(int j = i+1; j <= n; j++){
			if(dis(a[i][0],a[i][1],a[i][2],a[j][0],a[j][1],a[j][2]) <= r2)
				g[i].push_back(j), g[j].push_back(i);
		}
	}
	return bfs(0,n+1,n,g);
}

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin >> t;
	while(t--)
		cout << (solve() ? "Yes\n" : "No\n");
	
	return 0;
}