123

#include<iostream>
#include<cmath>
using namespace std;
int x[101], y[101], r[101], p[101], n, d;
void dfs(int k) {
	p[k] = 1;
	if (k != n) {
		for (int i = n; i > 0; --i) {
			if(p[i] == 0 && sqrt((x[i] - x[k]) * (x[i] - x[k]) +
				(y[i] - y[k]) * (y[i] - y[k])) - r[i] - r[k] <= d)
				dfs(i);
		}
	}
}
int main() {
	int i;
	cin >> n >> d;
	for (i = 1; i <= n; ++i)
		cin >> x[i] >> y[i] >> r[i];
	dfs(1);
	if (p[n])
		cout << "YES";
	else
		cout << "NO";
}