#include <bits/stdc++.h>
#define int short
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");

const int MAX=3500;
int n,t,i,sol,dp[MAX+5],y,z,j,k,add,AIB[MAX+5][MAX+5];

struct elem{
int x,y,z;}v[MAX+5];

bool compare(elem a, elem b)
{
    if (a.x!=b.x)
    return a.x<b.x;

    if (a.y!=b.y)
    return a.y<b.y;

    if (a.z!=b.z)
        return a.z<b.z;
}

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>0; i-=(i&(-i)))
        for (int j=y; j>0; j-=(j&(-j)))
           ans=max(ans,AIB[i][j]);

    return ans;
}

void solve()
{
    memset(AIB,0,sizeof(AIB));

    for (i=1; i<=n; i++)
    {
        y=v[i].y;
        z=v[i].z;

        add=0;

        dp[i]=query(y-1,z-1)+1;
        update(y,z,dp[i]);
    }
}


signed main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0); fout.tie(0);

    fin>>n>>t;

    while (t--)
    {
        sol=0;


        for (i=1; i<=n; i++)
            fin>>v[i].x>>v[i].y>>v[i].z;

        sort(v+1,v+n+1,compare);

        for (i=1; i<=n; i++)
            dp[i]=0;

        solve();

        for (i=1; i<=n; i++)
            sol=max(sol,dp[i]);


        fout<<sol<<"\n";
    }
    return 0;
}