#include <bits/stdc++.h>

using namespace std;

ifstream fin("cutii.in");
ofstream fout("cutii.out");
const int Max = 3500;
struct Cutie {
    int x, y, z;
} p[Max + 2];
int n, q, i, a[Max + 2], r;
int aib[Max + 2][Max + 2];

static inline int Ub(int a) {
    return (a & -a);
}

static inline void Add(int pi, int pj, int val) {
    for(int i = pi; i <= Max; i += Ub(i)) {
        for(int j = pj; j <= Max; j += Ub(j)) aib[i][j] = max(aib[i][j], val);
    }
}

static inline void Set0(int pi, int pj) {
    for(int i = pi; i <= Max; i += Ub(i)) {
        for(int j = pj; j <= Max; j += Ub(j)) aib[i][j] = 0;
    }
}

static inline int Sum(int pi, int pj) {
    int sum = 0;
    for(int i = pi; i >= 1; i -= Ub(i)) {
        for(int j = pj; j >= 1; j -= Ub(j)) sum = max(sum, aib[i][j]);
    }
    return sum;
}

static inline bool Cmp(Cutie a, Cutie b){
    return (a.x < b.x);
}

int main() {
    fin >> n >> q;
    while(q--) {
        for(i = 1; i <= n; i++) fin >> p[i].x >> p[i].y >> p[i].z;
        sort(p + 1, p + n + 1, Cmp);

        r = 0;
        for(i = 1; i <= n; i++) {
            int s = Sum(p[i].y - 1, p[i].z - 1);

            a[i] = s + 1;
            r = max(r, a[i]);

            Add(p[i].y, p[i].z, a[i]);
        }

        fout << r << "\n";
        for(i = 1; i <= n; i++) Set0(p[i].y, p[i].z);
    }

    return 0;
}