#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2e5+5;
template<typename type>
inline void read(type &x){
	x=0;
	static bool flag;
	flag=0;
	char ch=getchar();
	while(!isdigit(ch)) flag=ch=='-',ch=getchar();
	while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	flag?x=-x:0;
}
struct node{
	ll a,b,t;
}f[N];
int c,T;
int n;
ll curt,tot;
bool flagA,flagB,flagC;
int buc[3010],pos[3010];
void init(){
	flagA=1,flagB=1,flagC=1;
	tot=0,curt=0;
	memset(buc,0,sizeof(buc));
	memset(pos,0,sizeof(pos));
	memset(f,0,sizeof(f));
}
bool cmp1(node x,node y){
	return x.t<y.t;
}
bool cmp2(node x,node y){
	if(x.t==y.t)  return x.b>y.b;
	return x.t<y.t;
}
int main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	read(c),read(T);
	while(T--){
		init();
		read(n);
		for(int i=1;i<=n;i++){
			read(f[i].a),read(f[i].b),read(f[i].t);
			tot+=abs(f[i].b-f[i].a);
			if(f[i].t!=f[i-1].t&&i>1) flagA=0;
			if(f[i].a>f[i].b){
				flagC=0;
				flagB=0;				
			}
			if(f[i].a<f[i-1].b&&i>1) flagB=0;
		}
//		cout<<flagA<<" "<<flagB<<" "<<flagC<<endl;
		if(flagA){
			if(tot>f[1].t) printf("No\n");
			else printf("Yes\n");
			continue;
		}
		else if(flagB){
			int p=0;
			sort(f+1,f+n+1,cmp1);
			for(int i=1;i<=n;i++){
				p=i;
				curt+=(f[i].b-f[i].a);
				if(curt>f[i].t){
					printf("No\n");
					break;
				}
			}
			if(curt<=f[p].t){
				printf("Yes\n");
			}
			continue;
		}
		else if(flagC&&!(flagB)){
			int p=0;
			sort(f+1,f+n+1,cmp2);
			for(int i=1;i<=n;i++){
				p=i;
				curt+=(f[i].b-f[i].a);
				if(curt>f[i].t){
					printf("No\n");
					break;
				}
			}
			if(curt<=f[p].t){
				printf("Yes\n");
			}
			continue;
		}
		else if(n<=200){
//			printf("11111111\n");
			int add,p=0;
			sort(f+1,f+n+1,cmp1);
			for(int i=1;i<=n;i++){
				buc[f[i].a]=1;
				pos[f[i].a]=i;
			}
			for(int i=1;i<=n;i++){	
				buc[f[i].a]=0;
//			    printf("%d\n",f[i].a);			
				add=1;
				p=i;
				if(f[i].a<f[i].b){
					
					for(int j=f[i].a+1;j<=f[i].b;j++){
						if(buc[j]){							
							buc[j]=0;
							f[pos[j]].a=f[i].b+add;
							pos[f[i].b+add]=pos[j];
							buc[f[i].b+add]=1;
							curt=curt+f[i].b+add-j;
							add++;							
						}
						curt++;
						
					}
				}
				else{
					
					for(int j=f[i].a-1;j>=f[i].b;j--){
						if(buc[j]){
							buc[j]=0;
							f[pos[j]].a=f[i].b-add;
							pos[f[i].b-add]=pos[j];
							buc[f[i].b-add]=1;
							curt=curt+j-f[i].b+add;
							add++;							
						
						}
						curt++;						
					}
					
				}
//				for(int i=1;i<=n;i++) printf("%d ",f[i].a);
//				cout<<endl;
//				cout<<curt<<endl;
				if(curt>f[i].t){
					printf("No\n");
					break;
				}
			}
			if(curt<=f[p].t){
				printf("Yes\n");				
			}
			continue;
		}
		else{
			int p=0;
			sort(f+1,f+n+1,cmp1);
			for(int i=1;i<=n;i++){
				p=i;
				curt+=(f[i].b-f[i].a);
				if(curt>f[i].t){
					printf("No\n");
					break;
				}
			}
			if(curt<=f[p].t){
				printf("Yes\n");
			}
			continue;
		}
	}
	return 0;
}