#include <cstdio>
#include <iostream>
#include <algorithm>
#define max(A,B) (A>B?A:B)
#define min(A,B) (A<B?A:B)
#define ll long long
#define int long long
const int N = 2e5 + 5;
const int M = 505;
const int INF = 0x3f3f3f3f;
using namespace std;

inline int read() {
    int s = 0, f = 1;
    char ch = getchar();

    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;

        ch = getchar();
    }

    while (ch >= '0' && ch <= '9') {
        s = s * 10 + ch - '0';
        ch = getchar();
    }

    return  s * f;
}

int n, m, h, r, flag, vis[N];

struct node {
    int x, y, z;
} a[N];

inline bool ask(node q, node p) {
    int d = (q.x - p.x) * (q.x - p.x) + (q.y - p.y) * (q.y - p.y) + (q.z - p.z) * (q.z - p.z);

    if (d <= 4 * r * r)
        return true;

    return false;
}

void dfs(int now) {
    if (flag)
        return ;

    if (a[now].z + r >= h) {
        flag = 1;
        return ;
    }

    for (int i = 1; i <= n; i++) {
        if (vis[i])
            continue;

        if (!ask(a[i], a[now]))
            continue;

        vis[i] = 1;
        dfs(i);
    }
}

signed main() {
    //  freopen("cheese.in","r",stdin);
    //  freopen("cheese.out","w",stdout);
    int T = read();

    while (T--) {
        n = read(), h = read(), r = read() ;
        flag = 0;

        for (int i = 1; i <= n; i++)
            a[i].x = read(), a[i].y = read(), a[i].z = read(), vis[i] = 0;

        for (int i = 1; i <= n; i++)
            if (a[i].z <= r)
                vis[i] = 1, dfs(i);

        if (flag)
            puts("Yes");
        else
            puts("No");
    }

    return 0;
}