#include<bits/stdc++.h>
#define int long long
using namespace std;
int read(){
	int res=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		res=res*10+ch-'0';
		ch=getchar();
	}
	return res*f;
}
const int MAXN=2e5+10;
const int mod=998244353;

int c,T,n,t,a[MAXN],y[MAXN];
bool judge;
struct node{
	int a,b,t,id;
}p[MAXN];

bool cmp(node n1,node n2){
	return n1.t<n2.t;
}

int find(int id,int from,int to){
	int tot=0;
	if(from<to){
		int pos=upper_bound(a+1,a+n+1,to)-a-1;
		for(int j=pos;j>id;j--) tot+=find(j,a[j],to+(j-id));
	}
	if(from>to){
		int pos=lower_bound(a+1,a+n+1,to)-a;
		for(int j=pos;j<id;j++) tot+=find(j,a[j],to-(id-j));
	}
	p[y[id]].a=a[id]=to;
	return tot+abs(from-to);
}

signed main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
//	freopen("move2.in","r",stdin);
//	freopen("move5.out","w",stdout);
	c=read();T=read();
	while(T--){
		n=read();t=0;judge=true;
		for(int i=1;i<=n;i++){a[i]=p[i].a=read();p[i].b=read();p[i].t=read();p[i].id=i;}
		if(c==12){
			for(int i=1;i<=n;i++) t+=abs(p[i].a-p[i].b);
			cout<<(t>p[1].t?"No":"Yes")<<endl;
			continue;
		}
		stable_sort(p+1,p+n+1,cmp);
		for(int i=1;i<=n;i++) y[p[i].id]=i;
		for(int i=1;i<=n;i++){
			t+=find(p[i].id,p[i].a,p[i].b);
			if(t>p[i].t){
				judge=false;
				break;
			}
		}
		cout<<(judge?"Yes":"No")<<endl;
	}
	return 0;
}