#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+9,M=2e9;
int c,T,n,id[N],bef[N],aft[N],eff[N];
/*
bef:before
aft:after
eff:effect(afterward)
*/
struct box{
    int a,b,t,id;
    bool operator < (const box &x) const {
        return a<x.a;
    }
} bx[N];
bool bytime(const box &a,const box &b){
    return a.t<b.t||a.t==b.t&&a.id>b.id;
}
bool bya(const box &a,const box &b){
    return a.a<b.a;
}
void print(int i){
    cout<<bx[i].id<<" "<<bx[i].a<<" "<<bx[i].b<<" "<<bx[i].t<<" "<<
    bef[i]<<" "<<aft[i]<<" "<<eff[i]<<"\n";
}
int bitsmn[N],bitsmx[N];
int LSB(int u){
    return u&(-u);
}
void add(int u){
    int val=u,up=n+1-u;
    while(up<=n){
        bitsmn[up]=min(bitsmn[up],val);
        up+=LSB(up);
    }
    while(u<=n){
        bitsmx[u]=max(bitsmx[u],val);
        u+=LSB(u);
    }
}
void query(int u){
    int up=n+1-u;
    aft[u]=1e9;
    while(up){
        aft[u]=min(aft[u],bitsmn[up]);
        up-=LSB(up);
    }
    up=u;
    bef[u]=0;
    while(up){
        bef[u]=max(bef[u],bitsmx[up]);
        up-=LSB(up);
    }
}
void solve(){
    scanf("%lld",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld%lld%lld",&bx[i].a,&bx[i].b,&bx[i].t);
        if(bx[i].a>=bx[i].b) bx[i].a=M-bx[i].a,bx[i].b=M-bx[i].b;
    }
    sort(bx+1,bx+1+n,bya);
    for(int i=1;i<=n;i++) bx[i].id=i;
    sort(bx+1,bx+1+n,bytime);
    for(int i=1;i<=n;i++) bitsmn[i]=1e9,bitsmx[i]=0;
    for(int i=1;i<=n;i++){
        id[i]=bx[i].id;
        query(id[i]);
        add(id[i]);
    }
    sort(bx+1,bx+1+n,bya);
    eff[0]=1;
    for(int i=1;i<=n;i++){
        eff[i]=eff[i-1];
        while(bx[i].b+eff[i]-i>bx[eff[i]].a&&eff[i]<=n) eff[i]++;
        eff[i]--;
        //print(i);
    }
    //for(int i=1;i<=n;i++) print(id[i]);
    int timer=0;
    for(int i=1;i<=n;i++){
        int u=id[i],up=id[i];
        //print(u);
        if(eff[bef[u]]>=u&&bef[u]){
            timer+=
            (bx[u].b-(bx[bef[u]].b+u-bef[u]))*
            (min(eff[bef[u]],aft[u]-1)-u+1);
            /////////!!!!!!!!!!!!!!!!!!!!
            //someone have gone!
            up=eff[bef[u]]+1;
        }
        for(;up<=min(eff[u],aft[u]-1);up++){
            //cout<<up<<":"<<" "<<bx[up].a<<" "<<timer<<"+=";
            timer+=bx[u].b+up-u-bx[up].a;
            //cout<<bx[u].b+up-u-bx[up].a<<"\n";
        }
        //cout<<"**"<<timer<<" "<<bx[u].t<<"\n";
        if(timer>bx[u].t){
            //cout<<i<<" "<<u<<" "<<timer<<" "<<bx[u].t<<"\n";
            //print(u);
            printf("No\n");
            return;
        }
    }
    printf("Yes\n");
}
signed main(){
    //caution: long long needed!
    freopen("move.in","r",stdin);
    freopen("move.out","w",stdout);
    scanf("%lld%lld",&c,&T);
    while(T--){
        solve();
    }
    return 0;
}