#include <fstream>
#include <algorithm>

using namespace std;

int t;
int n;

struct cutie{
    int x, y, z;
};

bool sortez(cutie a, cutie b) {
    if (a.x == b.x) {
        if (a.y == b.y) {
            return a.z < b.z;
        }
        return a.y < b.y;
    }
    return a.x < b.x;
};

int aib[3505][3505];

cutie v[3505];

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 rez = 0;
    for (int i = x; i; i -= i & (-i)) {
        for (int j = y; j; j -= j &(-j)) {
            rez = max(aib[i][j], rez);
        }
    }
    return rez;
}

void setZero(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() {
    ifstream cin("cutii.in");
    ofstream cout("cutii.out");
    cin>>n>>t;
    while(t) {
        --t;

        for (int i = 1; i <= n; ++i) {
            cin>>v[i].x>>v[i].y>>v[i].z;
        }
        sort(v + 1, v + n + 1, sortez);
        for (int i = 1; i <= n; ++i) {
            int l = query(v[i].y - 1, v[i].z - 1);
            update(v[i].y, v[i].z, l + 1);
        }
        cout<<query(n, n)<<"\n";
        for (int i = 1; i <= n; ++i) {
            setZero(v[i].y, v[i].z);
        }
    }
    return 0;
}