#include<bits/stdc++.h>
using namespace std;
double sum,n,h,r,t;
int main(){
	cin>>t;
	while(t--){
		struct edge{
			double a,b,c;
		}e[1005];	
		sum=0;
		cin>>n>>h>>r>>e[1].a>>e[1].b>>e[1].c;	 
		for(int i=2;i<=n;i++){
			cin>>e[i].a>>e[i].b>>e[i].c;
			if(sqrt((e[i].a-e[i-1].a)*(e[i].a-e[i-1].a)+(e[i].b-e[i-1].b)*(e[i].b-e[i-1].b)+(e[i].c-e[i-1].c)*(e[i].c-e[i-1].c))<=2*r){
				sum+=2*r+sqrt((e[i].a-e[i-1].a)*(e[i].a-e[i-1].a)+(e[i].b-e[i-1].b)*(e[i].b-e[i-1].b)+(e[i].c-e[i-1].c)*(e[i].c-e[i-1].c));
			}
		}
		if(sum>=h)cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}