#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <set>
#define int long long
using namespace std;
const int N = 2e5 + 7;
int read()
{
    int s = 0;char ch;
    while(!isdigit(ch)) ch = getchar();
    while(isdigit(ch)) s = s * 10 + ch - '0',ch = getchar();
    return s;
}
void write(int x)
{
    if(x < 10) putchar(x + '0');
    else write(x / 10),putchar(x % 10 + '0');
}
struct xd
{
    int t0;
    int nod;
}g[N];
struct nd
{
    int ai;
    int bi;
    int bl;
    int lx;
}s[N];
bool cmp(xd a,xd b)
{
    return a.t0 < b.t0;
}
int cnt;
int kl[N];
int kr[N];
int c,T;
int n;
void Sub2()
{
    int sum = 0;
    n = read();
    for(int i = 1;i <= n;i ++) s[i].ai = read(),s[i].bi = read(),g[i].t0 = read(),g[i].nod = i,sum += abs(s[i].ai - s[i].bi);
    if(sum <= g[1].t0) cout <<"Yes" << endl;
    else cout <<"No" << endl;
}
signed main(){
    freopen("move.in","r",stdin);
    freopen("move.out","w",stdout);
    c = read(); T = read();

    s[0].lx = -1;
    while(T --)
    {
        if(c == 1 || c == 4 || c == 8 || c == 12) {Sub2();continue;}
        cnt = 0;
        n = read();
        for(int i = 1;i <= n;i ++) s[i].ai = read(),s[i].bi = read(),g[i].t0 = read(),g[i].nod = i;
        for(int i = 1;i <= n;i ++)
        {
            if(s[i].ai <= s[i].bi) s[i].lx = 1;
            else s[i].lx = 0;
            if(s[i].lx == s[i - 1].lx)
            {
                s[i].bl = cnt;
                kr[cnt] = i;
            }
            else
            {
                cnt ++;
                kl[cnt] = i;
                kr[cnt] = i;
                s[i].bl = cnt;
            }
        }
        sort(g + 1,g + n + 1,cmp);
        int tm = 0;
        bool f = 1;
        for(int i = 1;i <= n;i ++)
        {
            int now = g[i].nod;
            if(tm > g[i].t0)
            {
                f = 0;
                break;
            }
            if(s[now].lx == 0)
            {
                int cst = 0;
                for(int j = now;j >= kl[s[now].bl];j --)
                {
                    if(s[j].ai >= s[now].bi)
                    {
                        tm += (s[j].ai - s[now].bi + cst);
                        s[j].ai = s[now].bi - cst;
                        cst ++;
                    }
                    else break;
                }
            }
            else
            {
                int cst = 0;
                for(int j = now;j <= kr[s[now].bl];j ++)
                {
                    if(s[j].ai <= s[now].bi)
                    {
                        tm += (s[now].bi + cst - s[j].ai);
                        s[j].ai = s[now].bi + cst;
                        cst ++;
                    }
                    else break;
                }
            }

            if(tm > g[i].t0)
            {
                f = 0;
                break;
            }
        }
        if(f) cout << "Yes" << endl;
        else cout <<"No"<<endl;
    }
}