#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int x,i,j,n,T,best[3505],maxim;
struct point
{
    int x,y,z;
}v[3505];
inline bool cmp(point a,point b)
{
    return a.z<b.z;
}
inline void reset()
{
    for (register int i=1;i<=n;i++) best[i]=0;
}
int main()
{
    f>>n>>T;
    while (T--)
    {
        for (i=1;i<=n;i++) f>>v[i].x>>v[i].y>>v[i].z;
        sort (v+1,v+n+1,cmp);
        maxim=1;
        for (i=1;i<=n;i++)
        {
            best[i]=1;
            for (j=1;j<i;j++)
            {
                if (best[j]+1>best[i] && v[j].x<v[i].x && v[j].y<v[i].y)
                {
                    best[i]=best[j]+1;
                    maxim=best[i];
                }
            }
        }
        reset();
        g<<maxim<<"\n";
    }
    f.close(); g.close();
    return 0;
}