#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream cin("cutii.in");
ofstream cout("cutii.out");

struct cutie{
int x,y,z;
}a[3510];
int dp[3510][3510];
int n,t,x,y,z;
bool cmp(cutie a, cutie b)
{
    if(a.z == b.z) return a.x < b.x;
    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))
            dp[i][j] = max(dp[i][j],val);
}

int query(int x, int y)
{
    int aux = dp[x][y];
    for(int i=x; i>0; i-= i&(-i))
        for(int j=y; j>0; j-= j&(-j))
            aux = max(aux,dp[i][j]);

    return aux;
}


int main()
{
    cin>>n>>t;
    while(t--)
    {
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;++i)
        {
            cin>>x>>y>>z;
            a[i].x = x;
            a[i].y = y;
            a[i].z = z;

        }

        int sol = 0;
        sort(a+1,a+n+1,cmp);

        update(a[1].x,a[1].y,1);

        for(int i=2;i<=n;++i)
        {
            int aux = query(a[i].x-1,a[i].y-1);
            update(a[i].x,a[i].y,aux+1);

            sol = max(sol,aux+1);
        }


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