大佬救救

#include<bits/stdc++.h>
using namespace std;
typedef long long lld;
//-----------------------------------------------------
struct hole
{
	lld x,y,z;
}a[2020];
int Q,n,h,r,flag=0;
bool cmp(hole aa,hole bb)
{
	if(aa.x!=bb.x)return aa.x<bb.x;
	else if(aa.y!=bb.x)return aa.y<bb.y;
	else return aa.z<bb.z; 
}
lld pp(lld kk)
{
	return kk*kk;
}
void dfs(int k)
{
	if(a[k].z+r>=h)
	{
		//cout<<"#"<<a[k].x<<" "<<a[k].y<<" "<<a[k].z<<endl;
		flag=1;
		return;
	}
	bool ff=0;
	for(int i=k+1;i<=n;i++)
	{
		if(int(sqrt(pp(a[k].x-a[i].x)+pp(a[k].y-a[i].y)+pp(a[k].z-a[i].z))<=r*2))
		{
			dfs(i);
			ff=1;
		}
	}
	if(!ff)
	{
		for(int i=k+1;i<=n;i++)if(a[i].z-r<=0)dfs(i);
		return;
	}
	return;
}
int main()
{
	cin>>Q;
	while(Q--)
	{
		flag=0; 
		cin>>n>>h>>r;
		for(int i=1;i<=n;i++)cin>>a[i].x>>a[i].y>>a[i].z;
		//sort(a+1,a+n+1,cmp);
		dfs(1);
		if(!flag)
		cout<<"No"<<endl;
		else cout<<"Yes"<<endl;
	}
/*
3
2 4 1
0 0 1
0 0 3
2 5 1
0 0 1
0 0 4
2 5 2 
0 0 2
2 0 4
*/
 	return 0;
}