#include <fstream>
#include <algorithm>
using namespace std;
ifstream fcin("cutii.in");
ofstream fout("cutii.out");
int n,t,rez;
const int sz=4000;
struct elem
{
    int x,y,z;
    bool operator<(const elem &a) const
    {
        return x<a.x;
    }
};
elem v[sz];
int aib[sz+5][sz+5],dp[sz+5];
inline void update(int x, int y, int val)
{
    for(int i=x; i<=sz; i+=(i & (-i)))
        for(int j=y; j<=sz; j+=(j & (-j)))
            aib[i][j]=max(aib[i][j],val);
}
inline int query(int x, int y)
{
    int rez=0;
    for(int i=x; i>0; i-=(i & (-i)))
        for(int j=y; j>0; j-=(j & (-j)))
            rez=max(rez,aib[i][j]);
    return rez;
}
int main()
{
    fcin>>n>>t;
    while(t--)
    {
        rez=0;
        for(int i=0; i<=sz; i++)
            for(int j=0; j<=sz; j++)
               aib[i][j]=0;
        for(int i=1; i<=n; i++)
            fcin>>v[i].x>>v[i].y>>v[i].z;
        sort(v+1, v+n+1);
        for(int i=1; i<=n; i++)
        {
            dp[i]=query(v[i].y,v[i].z)+1;
            update(v[i].y,v[i].z,dp[i]);
            rez=max(rez,dp[i]);
        }
        fout<<rez<<'\n';
    }
    return 0;
}