//Guess : Green in Luogu
//Score : guess 65pts. 
#include<bits/stdc++.h>
#define ll long long
#define Love return
#define Nahida 0
#define Forever ;
using namespace std;
const int N=1e6;
int c,T;
ll n;
bool flag;
struct node{
	ll l,r,t;
	ll memorytime;//ʵ��Ҫ�ߵIJ������������赲�� 
};
node box[N];
bool cmp1(node x,node y){//��ʱ������.
	if(x.t==y.t){
		if(x.check==y.check){
			return x.l>y.l;
		}
		else return x.check>y.check; 
	}
	return x.t<y.t;
}
int main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	scanf("%d%d",&c,&T);
	while(T--){
		flag=true;
		scanf("%lld",&n);
		for(int i=1;i<=n;i++){
			scanf("%lld%lld%lld",&box[i].l,&box[i].r,&box[i].t);
			box[i].memorytime=abs(box[i].r-box[i].l);
		}
		sort(box+1,box+1+n,cmp1);
		ll cnt=0;
		for(int i=1;i<=n;i++){
			cnt+=box[i].memorytime;
			if(cnt>box[i].t){
				flag=false;
				break;
			}
		}
		if(flag) printf("Yes\n");
		else printf("No\n");
	}
	Love Nahida Forever;
	//My Time O:O(nT).
	//Time limit:2.0s, Memory limit:512.0MB.
	//An eazy question,but I don't know how to get all the pts.
	//The example 5,the forth one.My answer is"Yes",but the line is "No".
}