#include<fstream>
#include<algorithm>
#define lsb(x) x&(-x)
using namespace std;

struct cutie{unsigned short x,y,z;} v[3502];
int n,t,i,ind[3502],aib[3502][3502],rez,mx;
bool cmp(int i,int j)
{
    return v[i].z<v[j].z;
}
int query(int x,int y)
{
    int i,j,S=0;
    for(i=x; i>=1; i-=lsb(i))
      for(j=y; j>=1; j-=lsb(j))
        S=max(S,aib[i][j]);
    return S;
}
void update(int x,int y)
{
    int i,j;
    for(i=x; i<=n; i+=lsb(i))
      for(j=y; j<=n; j+=lsb(j))
        aib[i][j]=max(aib[i][j],mx);
}
void init()//initializeaza aib-ul
{
    int i,j,k,x,y;
    for(k=1; k<=n; k++)
    {
        x=v[ind[k]].x;
        y=v[ind[k]].y;
        for(i=x; i<=n; i+=lsb(i))
          for(j=y; j<=n; j+=lsb(j))
            aib[i][j]=0;
    }
}
int main()//numarul maxim de cuibareala (cutii 3D)
{
    ifstream f("cutii.in");ofstream g("cutii.out");
    f>>n>>t;
    while(t--)
    {
        rez=mx=0;
        for(i=1; i<=n; i++)
        {
            f>>v[i].x>>v[i].y>>v[i].z;
            ind[i]=i;
        }
        sort(ind+1, ind+n+1, cmp);
        for(i=1; i<=n; i++)
        {
            mx=query(v[ind[i]].x, v[ind[i]].y);
            mx++;
            update(v[ind[i]].x, v[ind[i]].y);
            rez=max(rez,mx);
        }
        g<<rez<<"\n";
        init();
    }
    f.close();g.close();
    return 0;
}