#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <unordered_map>
using std::cin;
using std::cout;
using std::endl;
using std::cerr;
using std::queue;
using std::vector;
using std::stack;
using std::priority_queue;
using std::map;
using std::set;
using std::unordered_map;
typedef long long ll;
ll gcd(ll a,ll b){
    if(b==0) return a;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    return (a/gcd(a,b))*b;
}
ll exgcd(ll a,ll b,ll& x,ll& y){
    if(b==0){
        x=1; y=0;
        return a;
    }
    ll ret=exgcd(b,a%b,x,y);
    ll temp=y;
    y=x-(a/b)*y;
    x=temp;
    return ret;
}



const ll maxn=220000;



struct po{
    ll a,b,t,i;
    bool operator>(const po& y) const{
        if(t==y.t) return a>y.a;
        return t>y.t;
    }
};
int n;
int flagA=0,flagB=0,flagC=0;
po p[maxn],pr[maxn];
ll hmina[maxn];
void sovle2(){
    int ans=1;
    ll sum=0;
    for(int i=1;i<=n;i++){
        p[i].a=pr[p[i].i].a;
        int ifflag=0;
        if(p[i].a<p[i].b){
            ifflag=1;
        }

        sum+=abs(p[i].b-p[i].a);
        ll next=p[i].b;
        ll l=p[i].i;
        p[i].a=p[i].b; pr[p[i].i].a=p[i].a;
        if(ifflag==1){
            for(l=l+1;l<=n;l++){
                if(pr[l].a<=next){
                    next++;
                    sum+=abs(next-pr[l].a);
                    pr[l].a=next;
                }
                else{
                    break;
                }
            }
        }
        else{
            for(l=l-1;l>=1;l--){
                if(pr[l].a>=next){
                    next--;
                    sum+=abs(pr[l].a-next);
                    pr[l].a=next;
                }
                else{
                    break;
                }
            }
        }
        if(sum>p[i].t){
            ans=0;
            break;
        }
    }
    if(ans==1) printf("Yes\n");
    else printf("No\n");
    return;
}
void sovle(){
    priority_queue<po,vector<po>,std::greater<po> > q
        = priority_queue<po,vector<po>,std::greater<po> >();
    int scan_ret=scanf("%d",&n);
    for(int i=1;i<=n;i++){
        pr[i].i=i;
        scan_ret=scanf("%lld%lld%lld",&pr[i].a,&pr[i].b,&pr[i].t);
        hmina[i]=pr[i].a;
        q.push(pr[i]);
    }
    for(int i=n-1;i>=1;i--){
        hmina[i]=std::min(hmina[i],hmina[i+1]);
    }
    for(int i=1;i<=n;i++){
        if(i<n&&(pr[i].t!=pr[i+1].t)) flagA=0;
        if(i<n&&(pr[i].a>pr[i].b||pr[i].b>=hmina[i+1])) flagB=0;
        if(pr[i].a>pr[i].b) flagC=0;
    }
    for(int i=1;i<=n;i++){
        p[i]=q.top();
        q.pop();
    }
    // std::cerr<<"a:"<<flagA<<" b:"<<flagB<<" c:"<<flagC<<std::endl;
    if(n<=3000){
        sovle2();
    }
    else{
        if(flagA==1||flagB==1){
            int ans=1;
            ll sum=0;
            for(int i=1;i<=n;i++){
                sum+=abs(p[i].b-p[i].a);
                if(sum>p[i].t){
                    ans=0;
                    break;
                }
            }
            if(ans==1) printf("Yes\n");
            else printf("No\n");
        }
        else if(flagC==1){
            sovle2();
        }
        else{
            sovle2();
        }
    }
    while(!q.empty()) q.pop();
    memset(p,0,sizeof(p));
    memset(pr,0,sizeof(pr));
    memset(hmina,0,sizeof(hmina));
    return;
}
int main(){
    freopen("move.in","r",stdin);
    freopen("move.out","w",stdout);
    int c,T=1;
    int scan_ret=scanf("%d%d",&c,&T);
    for(int t=1;t<=T;t++){
        flagA=0; flagB=0; flagC=0;
        if(c==1||c==4||c==8||c==12) flagA=1;
        else flagA=0;
        if(c==5||c==9||c==13||c==19||c==20) flagB=1;
        else flagB=0;
        if(c==14||c==15||c==21||c==22) flagC=1;
        else flagC=0;
        sovle();
    }
    return 0;
}