#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
using namespace std;
inline ll max(ll x,ll y)
{
	return x>y?x:y;
}
inline ll min(ll x,ll y)
{
	return x<y?x:y;
}
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline ll read()
{
    char c=getchar();ll x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}
const ll N=2e5+10;
ll c,t,n;
struct tree
{
	bool la;
	ll s,x;
}f[N<<2];
struct node
{
	ll a,b,t;
}a[N];
pii q[N];
void build(int k,int l,int r)
{
	if(l==r)return f[k].s=f[k].x=a[l].a,void();
	int mid=(l+r)/2;
	build(k*2,l,mid);
	build(k*2+1,mid+1,r);
	f[k].s=f[k*2].s+f[k*2+1].s; 
}
void pushdown(int k,int l,int r,int mid)
{
	if(f[k].la!=1)return ;
	ll x=f[k].x;
	int ls=k*2,rs=k*2+1;
	f[ls]={1,(x+x+(mid-l))*(mid-l+1)/2,x};
	f[rs]={1,(x+(mid-l+1)+x+(r-l))*(r-mid)/2,x+(mid-l+1)};
	f[k].la=2;
}
ll ask(int k,int l,int r,int x,int y)
{
	if(x<=l&&r<=y)return f[k].s;
	if(f[k].la)return (f[k].x+x-l+f[k].x+y-l)*(y-x+1)/2;
	ll mid=(l+r)/2,ans=0;
	pushdown(k,l,r,mid);
	if(x<=mid)ans+=ask(k*2,l,mid,x,min(y,mid));
	if(y>mid)ans+=ask(k*2+1,mid+1,r,max(x,mid+1),y);
	return ans;
}
void change(int k,int l,int r,int x,int y,ll z)
{
	if(l>y||r<x)return ;
	if(x<=l&&r<=y)
	{
		f[k]={1,(z+z+(r-l))*(r-l+1)/2,z};
		return ;
	}
	ll mid=(l+r)/2;
	pushdown(k,l,r,mid),f[k].la=0;
	if(x<=mid)change(k*2,l,mid,x,y,z);
	if(y>mid)change(k*2+1,mid+1,r,max(x,mid+1),y,x<=mid?z+(mid-x+1):z);
	f[k].s=f[k*2].s+f[k*2+1].s;
}
bool check()
{
	build(1,1,n);
	for(int i=1;i<=n;i++)
		q[i]={a[i].t,i};
	sort(q+1,q+1+n);
	ll now=0;
	for(int i=1;i<=n;i++)
	{
		ll t=q[i].first,id=q[i].second;
		a[id].a=ask(1,1,n,id,id);
		ll x=a[id].a,y=a[id].b;
		if(x==y)
		{
			if(now>t)return false;
			else continue;
		}
		if(x>y)
		{
			ll l=0,r=id;
			if(c==19||c==20)l=id-1;
			else
			while(l+1<r)
			{
				ll mid=(l+r)/2;
				a[mid].a=ask(1,1,n,mid,mid);
				if(y-a[mid].a>=id-mid)l=mid;
				else r=mid;
			}
			ll s=ask(1,1,n,l+1,id);
			now+=s-(y+y-(id-l-1))*(id-l)/2;
			change(1,1,n,l+1,id,y-(id-l-1));
		}
		else
		{
			ll l=id,r=n+1;
			if(c==19||c==20)r=id+1;
			else
			while(l+1<r)
			{
				ll mid=(l+r)/2;
				a[mid].a=ask(1,1,n,mid,mid);
				if(a[mid].a-y>=mid-id)r=mid;
				else l=mid;
			}
			ll s=ask(1,1,n,id,r-1);
			now+=(y+y+(r-id-1))*(r-id)/2-s;
			change(1,1,n,id,r-1,y);
		}
		if(now>t)return false;
	}
	return true;
}
signed main()
{
//	freopen("move.in","r",stdin);
//	freopen("move.out","w",stdout);
	c=read(),t=read();
	while(t--)
	{
		n=read();
		for(int i=1;i<=n;i++)
			a[i].a=read(),a[i].b=read(),a[i].t=read();
		puts(check()?"Yes":"No");
		for(int i=1;i<=n*4;i++)
			f[i]={0,0,0};
	}
	return 0;
}
/*
500455298 
500452891 
*/