#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int read()
{
int x = 0, f = 1;
char c = getchar();
while(!isdigit(c))
{
if(c == '-')
{
f = -1;
}
c = getchar();
}
while(isdigit(c))
{
x = x * 10 + c - 48;
c = getchar();
}
return x * f;
}
const int maxn = 1010;
int fa[maxn];
int get(int x)
{
return fa[x] == x ? x : fa[x] = get(fa[x]);
}
int merge(int x, int y)
{
x = get(x), y = get(y);
fa[y] = x;
}
long long x[maxn], y[maxn], z[maxn];
long long sqr(long long x)
{
return x * x;
}
long long dis(int a, int b)
{
return sqr(x[a] - x[b]) + sqr(y[a] - y[b]) + sqr(z[a] - z[b]);
}
int main()
{
int T = read();
while(T--)
{
int n = read();
long long h = read(), r = read();
for (int i = 1; i <= n + 2; ++i)
{
fa[i] = i;
}
for (int i = 1; i <= n; ++i)
{
x[i] = read(), y[i] = read(), z[i] = read();
if(z[i] <= r)
{
merge(i, n + 1);
}
if(z[i] + r >= h)
{
merge(i, n + 2);
}
for (int j = 1; j < i; ++j)
{
if(dis(i, j) <= 4 * r * r)
{
merge(i, j);
}
}
}
if(get(n + 1) == get(n + 2))
{
puts("Yes");
}
else
{
puts("No");
}
}
return 0;
}