#include <fstream>
#include <algorithm>
#include <vector>

#define MAX 3550

using namespace std;

int n, rez[MAX];

struct cutie
{
    int x, y, z;
}v[MAX];

bool cmp(cutie a, cutie b)
{
    return a.x < b.x;
}

int main()
{
    ifstream in("cutii.in");
    ofstream out("cutii.out");
    int t, i, j, maxim;
    in>>n>>t;
    while(t--)
    {
        for(i = 1; i <= n; i++)
        {
            in>>v[i].x>>v[i].y>>v[i].z;
        }
        sort(v + 1, v + n + 1, cmp);
        maxim = 1;
        for(i = 1; i <= n; i++)
        {
            rez[i] = 1;
            for(j = i - 1; j; j--)
                if(v[i].y > v[j].y  && v[i].z > v[j].z && rez[j] + 1 > rez[i])
                    rez[i] = rez[j] + 1;
            if(rez[i] > maxim)
                maxim = rez[i];
        }
        out<<maxim<<'\n';
    }
    return 0;
}