#include <bits/stdc++.h>

using namespace std;

ifstream f("cutii.in");
ofstream g("cutii.out");

struct
{
    int x,y,z;
}a[3505];

int n,t,dp[3505];

void reset()
{
    for (int i=0; i<=n; i++ )
        dp[i]=0;
}


int main()
{
    f >> n >> t;
    while ( t )
    {
        for (int i=1; i<=n; i++ )
            f >> a[i].x >> a[i].y >> a[i].z;

        reset();

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

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

        g << maxi << '\n';

        t--;
    }
    return 0;
}