#include <iostream>
using namespace std;
typedef long long ll;
const ll maxn=1e3;
struct fsz{
    ll l;
    ll r;
};
fsz a[maxn];
ll t[maxn];
int main(){
    ll t1;
    cin>>t1;
    while(t1--){
        ll n,o;
        cin>>n>>o;
        for(ll i=1;i<=n;i++){
            cin>>t[i]>>a[i].l>>a[i].r;
        }
        a[0].r=a[0].l=o;
        ll l=o,r=o;
        ll flag=0;
        for(ll i=0;i<=n-1;i++){
            ll d=t[i+1]-t[i];
            l=l-d;
            r=r+d;
            l=max(l,a[i+1].l);
            r=min(r,a[i+1].r);
            if(l>r){
                cout<<"NO"<<endl;
                flag=1;
                break;
            }
        }
        if(flag==1) continue;
        cout<<"YES"<<endl;
    }
}