#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
const ll mod = 1000000007;
const ll INF = 1000000099;
const ll LINF = (ll)(1e18 + 99);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U>
inline bool chmin(T& t, const U& u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U>
inline bool chmax(T& t, const U& u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T, typename Y>
inline T mpow(T a, Y n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  int qq;
  cin >> qq;
  while (qq--) {
    ll n, m;
    cin >> n >> m;
    ll mn = m, mx = m, now = 0;
    bool can = true;
    V<tuple<ll, ll, ll>> v(n);
    ll x, y, z;
    for (ll i = 0; i < (ll)(n); ++i) {
      cin >> x >> y >> z;
      v[i] = make_tuple(x, y, z);
    }
    sort((v).begin(), (v).end());
    for (ll i = 0; i < (ll)(n); ++i) {
      mn -= get<0>(v[i]) - now;
      mx += get<0>(v[i]) - now;
      if (mx < get<1>(v[i]) || get<2>(v[i]) < mn) {
        can = false;
      }
      chmax(mn, get<1>(v[i]));
      chmin(mx, get<2>(v[i]));
      now = get<0>(v[i]);
    }
    if (can)
      cout << "YES" << '\n';
    else
      cout << "NO" << '\n';
  }
}
