#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef pair<int, int> Pair;
typedef long long ll;
const int MAXN = 5e3 + 4;
const double pie = acos(-1.0);
int n;
int D[MAXN];
int L[MAXN];
int R[MAXN];
bool simplecheck() {int mnX = 0;int mxX = R[0];for (int i = 0; i <= n; i++) {mnX = max(mnX, L[i]);mxX = min(mxX, R[i]);}return mnX <= mxX;}double getK(int x0, int x1, int y0, int y1) {return (y1 - y0) * 1.0 / (x1 - x0);
}double getAng(int x0, int x1, int y0, int y1) {if (x0 == x1)return pie / 2;double ang = atan(getK(x0, x1, y0, y1));if (ang < 0)return ang + pie;return ang;
}void getAngInterval(int x0, int y0, int i, double& a0, double& a1) {if (D[i] == y0) {a0 = 0;a1 = pie;}else if (D[i] > y0) {a0 = getAng(x0, R[i], y0, D[i]);a1 = getAng(x0, L[i], y0, D[i]);}else {a0 = getAng(x0, L[i], y0, D[i]);a1 = getAng(x0, R[i], y0, D[i]);}
}
int main() {int T;freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\input.txt", "r", stdin);freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\output.txt", "w", stdout);scanf("%d", &T);//cin >> T;for (int ti = 1; ti <= T; ti++) {scanf("%d%d", R, &n);for (int i = 1; i <= n; i++) {scanf("%d%d%d", D + i, L + i, R + i);}bool fl = simplecheck();if (!fl) {for (int i = 0; i <= n; i++) {double amn = 0, amx = pie;bool ok = true;for (int j = 0; j <= n && ok; j++) {double amnnow, amxnow;getAngInterval(L[i], D[i], j, amnnow, amxnow);if (amnnow > amx) {ok = false;break;}if (amxnow < amn) {ok = false;break;}amn = max(amn, amnnow);amx = min(amx, amxnow); //printf("From (%d, %d) to (%d, %d)->(%d, %d), ang [%.2f, %.2f], Overall [%.2f, %.2f]\n", L[i], D[i], L[j], D[j], R[j], D[j], amnnow * 180.0 / pie, amxnow * 180.0 / pie, amn * 180.0 / pie, amx * 180.0 / pie);
}if (ok) {fl = true;break;}}}if (fl) {puts("YES");}else puts("NO");}return 0;
}