#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+99;
int c,T,n;
struct node{
	ll a,b;
	int id;
	ll t;
	friend bool operator < (node x,node y){
		return x.t<y.t;
	}
}box[N];
int pos[N];
int main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	cin>>c>>T;
	while(T--){
		memset(box,0,sizeof box);
		ll sumt=0;
		bool f=true;
		cin>>n;
		for(int i=1;i<=n;i++) cin>>box[i].a>>box[i].b>>box[i].t,box[i].id=i;
		sort(box+1,box+n+1);
		for(int i=1;i<=n;i++) pos[box[i].id]=i;
		for(int i=1;i<=n;i++){
			ll k=1;
			if(box[i].a<=box[i].b){
				if(box[pos[box[i].id+1]].a<=box[i].b) while(box[pos[box[i].id+k]].a<=box[i].b&&box[i].id+k<=n) k++;
				k--;
				while(box[i].b+k<box[pos[box[i].id+k]].a) k++;
				for(int j=box[i].id;j<=box[i].id+k;j++){
					int idd=pos[j],dis=j-box[i].id;
					sumt+=(box[i].b-box[idd].a+dis);
					box[idd].a=box[i].b+dis;
				}
				if(sumt>box[i].t){
					f=false,cout<<"No\n";
					break;
				}				
			}
			else{
				if(box[pos[box[i].id-1]].a>=box[i].b) while(box[pos[box[i].id-k]].a>=box[i].b&&box[i].id-k>0) k++;
				k--;
				while(box[i].b-k>box[pos[box[i].id-k]].a) k++;
				for(int j=box[i].id;j>=box[i].id-k;j--){
					int idd=pos[j],dis=box[i].id-j;
					sumt+=(-(box[i].b)+box[idd].a+dis);
					box[idd].a=box[i].b-dis;
				}
				if(sumt>box[i].t){
					f=false,cout<<"No\n";
					break;
				}		
			}
		}
		if(f) cout<<"Yes\n";
	}
	return 0;
}