#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 2e5 + 10;

struct Seg{
	ll l,r,limt,add;
	bool operator< (const Seg& L) const{
		return l < L.l;
	}
} seg1[N],seg2[N]; //-> <-

struct Node{
	ll w,t,i;
	bool operator< (const Node& T) const{
		return t < T.t;
	}
} op[N];

ll idx,sum;
ll cnt1,cnt2;
ll C,T,n;

void solve(Seg seg[],ll cnt)
{
	for(int i = 1;i <= cnt;i ++)
	{
		ll k = 1,j = i + 1;
		while(seg[i].r >= seg[j].l && j <= cnt)
		{
		    ll x = seg[i].r + k - seg[j].l;

            if(seg[i].limt <= seg[j].limt)
            {
                seg[i].add += x + seg[j].add;
                seg[j].add = 0;
            }
            else seg[j].add += x;

			seg[j].l = seg[i].r + k;
			j ++,k ++;
		}

		op[++ idx] = {seg[i].r-seg[i].l+seg[i].add,seg[i].limt};
	}
}

int main()
{
    freopen("move.in","r",stdin);
    freopen("move.out","w",stdout);

	scanf("%lld%lld",&C,&T);
	while(T --)
	{
		scanf("%lld",&n);
		sum = cnt1 = cnt2 = idx = 0;

		for(int i = 1;i <= n;i ++)
		{
			ll l,r,t;
			scanf("%lld%lld%lld",&l,&r,&t);
			if(l <= r) seg1[++ cnt1] = {l,r,t,0};
			else seg2[++ cnt2] = {r,l,t,0};
		}

		sort(seg1+1,seg1+cnt1+1);
		sort(seg2+1,seg2+cnt2+1);

		solve(seg1,cnt1);
		solve(seg2,cnt2);

		bool flag = true;
		sort(op+1,op+idx+1);
		for(int i = 1;i <= idx;i ++)
		{
			sum += op[i].w;
			if(sum > op[i].t)
			{
				flag = false;
				break;
			}
		}

		if(flag) puts("Yes");
		else puts("No");
	}

	return 0;
}