/**
    Multumesc Narci6ix
**/
#include<bits/stdc++.h>
#define zeros(x) (x&(-x))
#define maxN 3505
#define dim 1000005
using namespace std;
int n;
int poz=0;
char buff[dim+5];
typedef struct tip
{
  int a,b,c;
};
int AIB[maxN][maxN],t,sol;
tip v[maxN];
bool cmp(tip x,tip y)
{
    return x.a<y.a;
}
void update(int x,int y,int val)
{
    for(int i=x;i<=n;i+=zeros(i))
    {
        for(int j=y;j<=n;j+=zeros(j))
        {
            AIB[i][j]=max(AIB[i][j],val);
        }
    }
}
void update2(int x,int y,int val)
{
    for(int i=x;i<=n;i+=zeros(i))
    {
        for(int j=y;j<=n;j+=zeros(j))
        {
            AIB[i][j]=val;
        }
    }
}
int query(int x,int y)
{
    int sol=0;
    for(int i=x;i>=1;i-=zeros(i))
    {
        for(int j=y;j>=1;j-=zeros(j))
        {
            sol=max(sol,AIB[i][j]);
        }
    }
    return sol;
}
void read(int &nr)
{
    nr=0;
    while(buff[poz]<'0' || buff[poz]>'9')
    {
        poz++;
        if(poz==dim)
        {
            poz=0;
            fread(buff,1,dim,stdin);
        }
    }
    while(buff[poz]>='0' && buff[poz]<='9')
    {
        nr=nr*10+buff[poz]-'0';
        poz++;
        if(poz==dim)
        {
            poz=0;
            fread(buff,1,dim,stdin);
        }
    }
}
int main()
{
    freopen("cutii.in","r",stdin);
    freopen("cutii.out","w",stdout);
    fread(buff,1,dim,stdin);
    read(n);
    read(t);
    for(int test=1;test<=t;test++)
    {
        for(int i=1;i<=n;i++)
        {
            read(v[i].a);
            read(v[i].b);
            read(v[i].c);
         //   scanf("%d%d%d",&v[i].a,&v[i].b,&v[i].c);
        }
        sort(v+1,v+n+1,cmp);
        sol=0;
        for(int i=1;i<=n;i++)
        {
            int q=query(v[i].b-1,v[i].c-1);
            update(v[i].b,v[i].c,q+1);
            sol=max(sol,q+1);
        }
        printf("%d\n",sol);
        for(int i=1;i<=n;i++) update2(v[i].b,v[i].c,0);
    }
    return 0;
}