#include <bits/stdc++.h>

using namespace std;
ifstream fin ("cutii.in");
ofstream fout ("cutii.out");
struct pct
{
    int x,y,z;
    bool operator<(pct b) const
    {
        return x<b.x;
    }
};
int n,t,i,j,ans;
int dp[3505];
pct a[3505];
int main()
{
    fin>>n>>t;
    while(t)
    {
        t--;
        for(i=1;i<=n;i++)
            fin>>a[i].x>>a[i].y>>a[i].z;
        sort(a+1, a+n+1);

        ans=0;
        for(i=1;i<=n;i++)
        {
            dp[i]=1;
            for(j=1;j<i;j++)
            {
                if(a[i].y>a[j].y && a[i].z>a[j].z)
                    dp[i]=max(dp[i], dp[j]+1);
            }

            ans=max(ans, dp[i]);
        }

        fout<<ans<<'\n';
    }
    return 0;
}