#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream cin("cutii.in");
ofstream cout("cutii.out");

struct cutie{
int x,y,z;
}a[3510];
int dp[3510];
int n,t,x,y,z;
bool cmp(cutie a, cutie b)
{
    if(a.z == b.z) return a.x < b.x;
    return a.z < b.z;
}

int main()
{
    cin>>n>>t;
    while(t--)
    {
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;++i)
        {
            cin>>x>>y>>z;
            a[i].x = x;
            a[i].y = y;
            a[i].z = z;
        }

        sort(a+1,a+n+1,cmp);

        dp[1] = 1;
        for(int i=2;i<=n;++i)
        {
            dp[i] = 1;
            for(int j=i-1;j>=1;--j)
            {
                if(a[i].x > a[j].x && a[i].y > a[j].y)
                    dp[i] = max(dp[i], 1+dp[j]);
            }
        }

        int sol = 0;
        for(int i=1;i<=n;++i)
            sol = max(sol,dp[i]);

        cout<<sol<<"\n";
    }
    return 0;
}