#include<bits/stdc++.h>
using namespace std;
long long a[200010],b[200010],t[200010];
bool lb[200010];
struct sct{
	long long a,b,t,idda;
	bool operator < (sct bbb) const{
		if (t!=bbb.t) return t<bbb.t;
		else return a<bbb.a;
	}
};

void solve(){
	priority_queue<sct> pqq;
	int n;
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>a[i]>>b[i]>>t[i];
		if (b[i]<a[i]) swap(a[i],b[i]),lb[i]=0;
		else{
			long long zzzasa=a[i];
			a[i]=1000000000-b[i]+1;
			b[i]=1000000000-zzzasa+1;
			lb[i]=1;
		}
		sct qwqaa;
		qwqaa.a=a[i];
		qwqaa.b=b[i];
		qwqaa.t=t[i];
		qwqaa.idda=i;
		pqq.push(qwqaa);
	}
	long long T=1000000000000000000;
	bool flag=0;
	while (!pqq.empty()){
		sct akkcs=pqq.top();
		pqq.pop();
		T=min(T,akkcs.t);
		if (akkcs.idda!=n && (a[akkcs.idda+1]<=b[akkcs.idda] && lb[akkcs.idda+1]==lb[akkcs.idda] && lb[akkcs.idda]==0)){
			T-=a[akkcs.idda+1]-1-a[akkcs.idda];
			a[akkcs.idda]=a[akkcs.idda+1]-1;
			akkcs.a=a[akkcs.idda];
			akkcs.t=t[akkcs.idda+1];
			t[akkcs.idda]=akkcs.t;
			pqq.push(akkcs);
		}
		else if (akkcs.idda!=1&&(a[akkcs.idda-1]<=b[akkcs.idda] && lb[akkcs.idda-1]==lb[akkcs.idda] && lb[akkcs.idda]==1)){
			T-=a[akkcs.idda-1]-1-a[akkcs.idda];
			a[akkcs.idda]=a[akkcs.idda-1]-1;
			akkcs.a=a[akkcs.idda];
			akkcs.t=t[akkcs.idda-1];
			t[akkcs.idda]=akkcs.t;
			pqq.push(akkcs);
		}
		else{
			T-=akkcs.b-akkcs.a;
			a[akkcs.idda]=b[akkcs.idda];
		}
		if (T<0){
			flag=1;
			break;
		}
		
	}
	if (flag) cout<<"No\n";
	else cout<<"Yes\n";
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	int c,T;
	cin>>c>>T;
	while (T--) solve();
	return 0;
}