#include <cstdio>
#include <algorithm>

#define DIM 3600
#define x first
#define y second.first
#define z second.second
using namespace std;

int N, T, D[DIM];
pair <int, pair <int, int> > Size[DIM];

int main ()
{
    freopen ("cutii.in" ,"r", stdin );
    freopen ("cutii.out","w", stdout);

    scanf ("%d %d", &N, &T);

    for (int t = 1; t <= T; t ++)
    {
        for (int i = 1; i <= N; i ++)
        {
            scanf ("%d", &Size[i].x);
            scanf ("%d", &Size[i].y);
            scanf ("%d", &Size[i].z);
        }

        sort (Size + 1, Size + N + 1);

        int maxim = 0;
        for (int i = 1; i <= N; i ++)
        {
            D[i] = 1;
            for (int j = i - 1; j >= 1; j --)
                if (D[j] >= D[i] && Size[i].x > Size[j].x && Size[i].y > Size[j].y && Size[i].z > Size[j].z)
                D[i] = 1 + D[j];

            maxim = max (maxim, D[i]);
        }

        printf ("%d\n", maxim);
    }

    fclose (stdin );
    fclose (stdout);

    return 0;
}