#include <bits/stdc++.h>
#define N_MAX 3505

using namespace std;

ifstream fin("cutii.in");

ofstream fout("cutii.out");

struct cutie
{
    int x, y, z;
} v[N_MAX];
int aib[N_MAX][N_MAX], n, t;
bool comp(cutie a, cutie b)
{
    return a.z <= b.z;
}
int query(int i, int j)
{
    int rez = 0;
    for (; i > 0; i -= (i & (-i)))
        for (; j > 0; j -= (j & (-j)))
        {
            rez = max(aib[i][j], rez);
        }
    return rez;
}
void update(int i, int j, int l)
{
    for (; i <= n; i += (i & (-i)))
        for (; j <= n; j += (j & (-j)))
        {
            aib[i][j] = max(aib[i][j], l);
        }
}
int main()
{
    fin >> n >> t;
    while (t--)
    {
        int sol = 0;
        for (int i = 1; i <= n; i++)
        {
            fin >> v[i].x >> v[i].y >> v[i].z;
        }

        sort(v + 1, v + n + 1, comp);
        for (int i = 1; i <= n; i++)
        {
            int rez = query(v[i].x, v[i].y) + 1;
            update(v[i].x, v[i].y, rez);
            sol = max(sol, rez);
        }
        fout << sol << '\n';
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                aib[i][j] = 0;
    }
}