#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 10;
#define int long long
int n;

struct item {
	int a, b, t;
	void read() {
		scanf("%lld%lld%lld", &a, &b, &t);
	}
} h[MAXN];

priority_queue<int, vector<int>, less<int>> q;
int offse;

bool handle1(int l, int r) { //ai < bi
	sort(h + l, h + r + 1, [](const item &a, const item &b)->bool {
		return (a.t - a.b + a.a) > (b.t - b.b + b.a);
	});
	for(int i = r; i >= l; i--) {
		/*if(!q.empty()) {
			if((q.top() - offse - h[i].b + h[i].a) < 0) return false;
		}*/
		if(h[i].t - offse < h[i].b - h[i].a) return false;
		offse += h[i].b - h[i].a;
		//q.push(h[i].t - h[i].b + h[i].a);
	}
	return true;
}

void init() {
	while(!q.empty()) q.pop();
	offse = 0;
}

signed main() {
	freopen("move.in", "r", stdin);
	freopen("move.out", "w", stdout);
	int c, T;
	scanf("%lld%lld", &c, &T);
	while(T--) {
		scanf("%lld", &n);
		for(int i = 1;  i <= n; i++) h[i].read();
		init();
		printf(handle1(1, n) ? "Yes\n" : "No\n");
	}
	return 0;
}