gg

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <map>
#include <utility>
using namespace std;
typedef long long ll;

void fastIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
void solve() {
    int n, s;
    cin >> n >> s;
    int ma = s, mi = s;
    int prevt = 0;
    bool flag = true;
    for (int i = 0; i < n; i++) {
        int tt, l, r;
        cin >> tt >> l >> r;
        int t = tt - prevt;
        if (r > ma)
            ma = min(r, ma + t);
        else ma = max(r, ma - t);

        if (l > mi)
            mi = min(l, mi + t);
        else mi = max(l, mi - t);

        if (l > ma || r < mi) {
            flag = false;
        }
        else if (mi >= l && mi <= r && ma > r)
            ma = r;
        else if (ma <= r && ma >= l && mi < l)
            mi = l;
        prevt = tt;
    }
    if (flag)
        cout << "YES\n";
    else
        cout << "NO\n";
    return;
}

int main() {
    fastIO();

    int t;
    cin >> t;
    for (int i = 0; i < t; i++)
        solve();

    return 0;
}