#include <fstream>
#include <algorithm>
#include <bits/stdc++.h>
#define MAXN 3505
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
int aib[MAXN][MAXN], n, t;
struct cutie{
    int x, y, z;
};
cutie v[MAXN];
bool comp(cutie c1, cutie c2) {
    if (c1.x == c2.x) {
        if (c2.y == c2.y)
            return c1.z < c2.z;
        return c1.y < c2.y;
    }
    return c1.x < c2.x;
}
void update(int poz1, int poz2, int val) {
    for (int i = poz1; i <= MAXN; i += i & -i) {
        for (int j = poz2; j <= MAXN; j += j & -j) {
            aib[i][j] = max(val, aib[i][j]);
        }
    }
}
int query(int poz1, int poz2) {
    int maxi = 0;
    for (int i = poz1; i >= 1; i -= i & -i) {
        for (int j = poz2; j >= 1; j -= j & -j) {
            maxi = max(maxi, aib[i][j]);
        }
    }
    return maxi;
}
int main()
{
    fin >> n >> t;
    for (int j = 0; j < t; ++j) {
        memset(aib, 0, sizeof(aib[0][0]) * MAXN * MAXN);
        for (int i = 0; i < n; ++i) {
            fin >> v[i].x >> v[i].y >> v[i].z;
        }
        sort(v, v + n, comp);
        for (int i = 0; i < n; ++i) {
            int q = query(v[i].y - 1, v[i].z - 1);
            update(v[i].y, v[i].z, q + 1);
        }
        fout << query(n, n) << "\n";
    }
    return 0;
}