#include<bits/stdc++.h>
using namespace std;
ifstream f("reactivi.in");
ofstream g("reactivi.out");
int n,t,q,i,j;
struct cutii
{
    int x,y,z,nr;
}u[4001];
bool cmp(cutii a,cutii b)
{
    return ((a.x<b.x)||((a.x==b.x)&&(a.y<b.y))||((a.x==b.x)&&(a.y==b.y)&&(a.z<b.z)));
}
int main()
{
    f>>n>>t;
    for(q=1;q<=t;q++)
    {
        for(i=1;i<=n;i++)
            f>>u[i].x>>u[i].y>>u[i].z,u[i].nr=1;
        sort(u+1,u+n+1,cmp);
        int M=0;
        for(i=1;i<=n;i++)
        {
            for(j=i+1;j<=n;j++)
            {
                if(u[i].x<u[j].x&&u[i].y<u[j].y&&u[i].z<u[j].z)
                {
                    u[j].nr=max(u[i].nr+1,u[j].nr);
                    if(u[j].nr>M)
                            M=u[j].nr;
                }
            }
        }
        g<<M<<'\n';
    }
    return 0;
}