#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int c,T;

const int N=2e5+5;
int n;
struct Node{ int u,v;ll t; }a[N],b[N],d[N];
int bcnt,dcnt;
bool cmpByU(const Node &a,const Node &b){ return a.u<b.u; }

int id[N];
bool cmpByT(const int &x,const int &y){ return a[x].t<a[y].t; }
//int Getmin(){
//	ll mi=1e17;
//	int id=0;
//	for(int i=1;i<=n;++i)
//		if(mi>a[i].t)mi=a[i].t,id=i;
//	return id;
//}
ll Move(int u,int to){
	if(a[u].u==to)return 0LL;
	ll ret=0;
	int tmp=to;
	if(a[u].u<to)
		for(int i=u+1;i<=n&&a[i].u<=to;++i){
			ret+=Move(i,++tmp);
		}
	else
		for(int i=u-1;i&&a[i].u>=to;--i){
			ret+=Move(i,--tmp);
		}
	ret+=abs(to-a[u].u);
	a[u].u=to;
	return ret;
}
void solve1(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d%d%lld",&a[i].u,&a[i].v,&a[i].t);
//		if(a[i].u==a[i].v)a[i].t=1e17+1;
	}
	sort(a+1,a+n+1,cmpByU);
	int mxv=0;
	for(int i=1;i<=n;++i){
		if(mxv>=a[i].v)return puts("No"),void();
		mxv=max(mxv,a[i].v);
	}
	for(int i=1;i<=n;++i)id[i]=i;
	sort(id+1,id+n+1,cmpByT);

	ll timer=0;
	for(int i=1,x;i<=n;++i){
		x=id[i];
		timer+=Move(x,a[x].v);
		if(timer>a[x].t)return puts("No"),void();
	}
	puts("Yes");
}

void solve2(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d%d%lld",&a[i].u,&a[i].v,&a[i].t);
//		if(a[i].u==a[i].v)a[i].t=1e17+1;
	}
	sort(a+1,a+n+1,cmpByU);
	int mxv=0;
	for(int i=1;i<=n;++i){
		if(mxv>=a[i].v)return puts("No"),void();
		mxv=max(mxv,a[i].v);
	}
	bcnt=dcnt=0;
	for(int i=1;i<=n;++i){
		if(a[i].u<a[i].v)b[++bcnt]=a[i];
		else if(a[i].u>a[i].v)d[++dcnt]=a[i];
	}
//	for(int i=1;i<=n;++i)id[i]=i;
//	sort(id+1,id+n+1,cmpByT);

	ll timer=0;
	for(int i=bcnt;i;--i){
		timer+=b[i].v-b[i].u;
		b[i].u=b[i].v;
		if(timer>b[i].t)return puts("No"),void();
	}
	for(int i=1;i<=dcnt;++i){
		timer+=d[i].u-d[i].v;
		if(timer>d[i].t)return puts("No"),void();
	}
	puts("Yes");
}
int main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	scanf("%d%d",&c,&T);
//	int t=0;
	while(T--){
//		if(++t==6)return 0;
		if(c==12)solve2();
		else solve1();
	}
	return 0;
}