为什么全WA啊

#include<bits/stdc++.h>
using namespace std;
int T,n,h,x[114514],y[114514],z[114514],flag;
long long r;
int main(){
	scanf("%d",&T);
	for(int q=1;q<=T;q++)
	{
		flag=0;
		memset(x,0,sizeof(x));
		memset(y,0,sizeof(y));
		memset(z,0,sizeof(z));
		scanf("%d%d%lld",&n,&h,&r);
		for(int i=1;i<=n;i++)
		{
			scanf("%d%d%d",&x[i],&y[i],&z[i]);
		}
		for(int i=1;i<n;i++)
		{
			if(sqrt((x[i]-x[i+1])*(x[i]-x[i+1])+(y[i]-y[i+1])*(y[i]-y[i+1])+(z[i]-z[i+1])*(z[i]-z[i+1]))>2*r)
			{
				flag=1;
				continue;
			}
		}
		if(flag) cout<<"No"<<endl;
		else cout<<"Yes"<<endl;
	}
	return 0;
}