#include <bits/stdc++.h>
using namespace std;
int t, i, j, ii, n, maxxx, maxx, L[1005], cutie[1005], l[1005], h[1005];
int main()
{
    ifstream f("cutii.in");
    ofstream g("cutii.out");
    f >> n >> t;
    for(ii = 1;ii <= t;ii++)
    {
        maxxx = 0;
        for(i = 1;i <= n;i++)
            f >> L[i] >> l[i] >> h[i];
        cutie[n] = 1;
        for(i = n - 1;i > 0;i--)
        {
            maxx = 0;
            for(j = i + 1;j <= n;j++)
                if(L[j] > L[i] && l[j] > l[i] && h[j] > h[i] && cutie[j] > maxx)maxx = cutie[j];
            cutie[i] = maxx + 1;
        }
        for(i = 1;i <= n;i++)
            if(cutie[i] > maxxx)maxxx = cutie[i];
        g << maxxx << "\n";
    }
    return 0;
}