#include <iostream>
#include <fstream>
#include <algorithm>
#define lsb(x) ((x)&(-x))

using namespace std;

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

struct cutie
{
    int h,w,l;

    cutie(int h=0,int w=0,int l=0): h(h), w(w), l(l) {}
}v[3505];

bool operator<(const cutie &a,const cutie &b){
    return (a.h<b.h);
}

int n;
int din[3505];
int aib[3505][3505];

void update(int p1, int p2, int val)
{
    for(int i = p1; i <= n; i += lsb(i))
        for(int j = p2; j <= n; j += lsb(j))
            aib[i][j] = max(aib[i][j], val);
}

void update2(int p1, int p2)
{
    for(int i = p1; i <= n; i += lsb(i))
        for(int j = p2; j <= n; j += lsb(j))
            aib[i][j] = 0;
}

int query(int p1, int p2)
{
    int ans = 0;

    for (int i = p1; i; i -= lsb(i))
        for (int j = p2; j; j -= lsb(j))
            ans = max(ans, aib[i][j]);

    return ans;
}

int main()
{
    int t = 0;
    fin >> n >> t;

    while (t--)
    {
        for (int i = 1; i <= n; ++i)
            cin >> v[i].h >> v[i].w >> v[i].l;
        sort(v + 1, v + n + 1);

        int ans = 0;
        for (int i = 1; i <= n; ++i)
        {
            din[i] = query(v[i].w - 1, v[i].l - 1) + 1;
            if (din[i] > ans)
                ans = din[i];

            update(v[i].w, v[i].l, din[i]);
        }

        fout << ans << '\n';

        for (int i = 1; i <= n; ++i)
            update2(v[i].w, v[i].l);
    }

    return 0;
}