#include <bits/stdc++.h>
#define int long long
using namespace std;

template<typename type>
inline void read(type &x)
{
    x = 0; static bool flag; flag = 0; char ch = getchar();
    while (!isdigit(ch)) flag = ch == '-', ch = getchar();
    while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
    flag ? x = -x : 0;
}

const int N = 2e5 + 5;
int n;
struct node
{
    int a, b, t, l;
}p[N];
int pos[N];

bool cmpB(node A, node B)
{
    return 1ll * A.t < 1ll * B.t;
}

void init()
{
    memset(pos, 0, sizeof(pos));
}

signed main()
{
    freopen("move.in", "r", stdin);
    freopen("move.out", "w", stdout);
    int c, T; read(c), read(T);
    while (T --)
    {
        init();
        read(n);
        for (int i = 1; i <= n; i ++)
            read(p[i].a), read(p[i].b), read(p[i].t), p[i].l = abs(p[i].b - p[i].a);
        int tme = 0;
            for (int i = 1; i <= n; i ++)
                tme += p[i].l;
        if (c == 1 || c == 4 || c == 8 || c == 12)
        {
            if (tme > p[1].t)
            {
                cout << tme << ' ' << p[1].t << endl;
                puts("No");
                continue;
            }            
            puts("Yes");    
            continue;        
        }
        else if (c == 5 || c == 9 || c == 13 || c == 19 || c == 20)
        {
            sort(p + 1, p + 1 + n, cmpB);
            int tme = 0; bool flag = true;
            for (int i = 1; i <= n; i ++)
            {
                tme += p[i].l;
                if (tme > p[i].t)
                { flag = false; break; }
            }
            if (flag) puts("Yes");
            else puts("No");
            continue;
        }
        sort(p + 1, p + 1 + n, cmpB);    
        for (int i = 1; i <= n; i ++)
            pos[p[i].a] = i;            
        tme = 0; bool flag = true;
        for (int i = 1; i <= n; i ++)
        {
            if (p[i].a == p[i].b) continue;
            tme += abs(p[i].b - p[i].a);
            int cnt = 0;
            if (p[i].a < p[i].b)
            {
                for (int j = p[i].a + 1; j <= p[i].b + cnt; j ++)
                {
                    if (pos[j])
                    {
                        cnt ++;
                        tme += p[i].b - p[pos[j]].a + cnt;
                        p[pos[j]].a = cnt + p[i].b;
                        pos[j] = 0;
                    }
                }
            }
            else
            {
                for (int j = p[i].a - 1; j >= p[i].b - cnt; j --)
                {
                    if (pos[j])
                    {
                        cnt ++;
                        tme += p[pos[j]].a - p[i].b + cnt;
                        p[pos[j]].a = p[i].b - cnt;
                        pos[j] = 0;
                    }
                }              
            }
            pos[p[i].a] = 0; p[i].a = p[i].b;
            if (tme > p[i].t)
            {
                flag = false;
                break;
            }
        }
        if (flag) puts("Yes");
        else puts("No");
    }
    return 0;
}