#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

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

const int MAXN = 3502;

struct elem {
    int x, y, z;

    bool operator<(const elem& other) const {
        return x < other.x;
    }
};

int N, T;
elem v[MAXN];
int aib[MAXN][MAXN];

void update(int x, int y, int val) {
    for (int i = x; i <= N; i += i & (-i))
        for (int j = y; j <= N; j += j & (-j)) {
            aib[i][j] = max(aib[i][j], val);
        }
}

int query(int x, int y) {
    int ans = 0;
    for (int i = x; i; i -= i & (-i))
        for (int j = y; j; j -= j & (-j)) {
            ans = max(ans, aib[i][j]);
        }
    return ans;
}

void reset(int x, int y) {
    for (int i = x; i <= N; i += i & (-i))
        for (int j = y; j <= N; j += j & (-j)) {
            aib[i][j] = 0;
        }
}

int main()
{
    fin >> N >> T;
    for (int t = 0; t < T; ++t) {
        for (int i = 0; i < N; ++i) {
            fin >> v[i].x >> v[i].y >> v[i].z;
        }
        sort(v, v + N);

        int ans = 0;
        for (int i = 0; i < N; ++i) {
            int d = query(v[i].y, v[i].z) + 1;
            update(v[i].y, v[i].z, d);
            ans = max(ans, d);
        }

        for (int i = 0; i < N; ++i) {
            reset(v[i].y, v[i].z);
        }

        fout << ans << '\n';
    }
    return 0;
}