#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define dim 3505
using namespace std;
struct box
{
    int x, y, z; // sortam dupa x y si facem sclm pe z in o(nlogn) sau o(n2) daca se poate
} v[dim];
int test_cases, n, maxi;
int best[dim], poz, nr, l[dim];
bool compare(box a, box b)
{
    return a.z < b.z;
}
bool verif(box a, box b)
{
    return (a.x < b.x && a.y < b.y && a.z < b.z);
}
int caut(box val)
{
    int st = 0, dr = nr, mid = 0;
    while(st <= dr)
    {
        mid = (st + dr) / 2;
        if(verif(v[l[mid]], val) && !verif(v[l[mid + 1]], val))
        {
            return mid;
        }
        else
        {
            if(verif(v[l[mid]], val))
            {
                st = mid + 1;
            }
            else
            {
                dr = mid - 1;
            }
        }
    }
    return nr;
}
ifstream fin("cutii.in");
ofstream fout("cutii.out");
int32_t main(int argc, char * argv[])
{
    fin >> n >> test_cases;
    while(test_cases--)
    {
        maxi = 0;
        memset(best, 0, sizeof best);
        memset(l, 0, sizeof l);
        for(int i = 1; i <= n; ++i)
        {
            fin >> v[i].x >> v[i].y >> v[i].z;
        }
        sort(v + 1, v + n + 1, compare);
        nr = 1, best[1] = l[1] = 1, poz = 0;
        for(int i = 2; i <= n; ++i)
        {
            poz = caut(v[i]);
            best[i] = poz + 1;
            l[poz + 1] = i;
            if(nr < poz + 1)
            {
                nr = poz + 1;
            }
            if(best[i] > maxi)
            {
                maxi = best[i];
            }
        }
        fout << maxi << '\n';
    }
    return 0;
}