#include<bits/stdc++.h>
#define pb emplace_back
#define ll long long 
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define int ll
using namespace std;
int n;
const int N=2e5+10;
int a[N],b[N],t[N],o[N];
inline bool cmp(int i,int j){return t[i]<t[j];}
struct node
{
    int l,r,d;
    friend bool operator < (const node &a,const node &b)
    {
        return a.l<b.l;
    }
};
set<node> s;
auto split(int x){
    auto p=*(--s.lower_bound((node){x+1,0,0}));
    s.erase(p);
    if(p.l<x) s.insert((node){p.l,x-1,p.d-(p.r-x+1)});
    if(p.r>x) s.insert((node){x+1,p.r,p.d});
    return s.insert((node){x,x,p.d-(p.r-x)}).first;
}
signed main()
{
    freopen("move.in","r",stdin);
    freopen("move.out","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int c,T;
    cin>>c>>T;
    while(T--)
    {
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i]>>b[i]>>t[i],o[i]=i;
        sort(o+1,o+n+1,cmp);
        s.clear();
        for(int i=1;i<=n;i++) s.insert((node){i,i,a[i]});
        bool f=0;
        ll nw=0;
        for(int p=1;p<=n;p++)
        {
            int i=o[p];
            auto g=split(i),gg=g;
            if((*g).d>b[i])
            {
                nw+=(*g).d-b[i];
                int to=b[i]-1;
                node op={i,i-1,to};
                while(g!=s.begin()&&(*prev(g)).d>to)
                {
                    node p=(*prev(g));
                    nw+=(p.r-p.l+1)*(p.d-to);
                    op.l=p.l;
                    to-=(p.r-p.l+1);
                    s.erase(p);
                }
                if(op.l<=op.r) s.insert(op);
            }
            else{
                nw+=b[i]-(*g).d;
                int to=b[i]+1;
                node op={i+1,i,to};
                while(next(g)!=s.end())
                {
                    node p=(*next(g));
                    if(p.d-(p.r-p.l)>=to) break;
                    nw+=(p.r-p.l+1)*(to-(p.d-(p.r-p.l)));
                    op.r=p.r;
                    to+=(p.r-p.l+1);
                    s.erase(p);
                }
                if(op.l<=op.r) op.d+=(op.r-op.l),s.insert(op);
            }
            s.erase(gg);
            s.insert((node){i,i,b[i]});
            if(nw>t[i]) {
                f=1;break;
            }
        }
        cout<<(f?"No\n":"Yes\n");
    }
    return 0;
}