#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("cutii.in");
ofstream fout("cutii.out");

struct cutie
{
    int x, y, z;

    bool operator<(const cutie & a) const
    {
        return x < a.x && y < a.y && z < a.z;
    }
};

void init_array(int v[], int n)
{
    for (int i = 0; i < n; i++)
        v[i] = 0;
}

int main()
{
    int t, n, dp[3501];
    cutie v[3501];

    fin >> n >> t;
    while (t)
    {
        int mx = 0;

        for (int i = 1; i <= n; i++)
            fin >> v[i].x >> v[i].y >> v[i].z;

        sort(v + 1, v + n + 1);
        init_array(dp, n + 1);
        for (int i = 1; i <= n; i++)
        {
            for (int j = 0; j < i; j++)
                if (v[j] < v[i] && dp[j] + 1 > dp[i])
                    dp[i] = dp[j] + 1;
            mx = max(mx, dp[i]);
        }
        fout << mx << '\n';
        t--;
    }
    return 0;
}