#include <bits/stdc++.h>
#define maxN 3504
#define UB(x) ((x)&(-x))
using namespace std;
struct cutie
{
    int x,y,z;
}v[maxN];
int T,n,i,j,k,sol,aux;
int aib[maxN][maxN];
bool cmp1(cutie a,cutie b)
{
    if(a.x==b.x)
        return a.y*a.z<b.y*b.z;
    else return a.x<b.x;
}
void update(int x,int y)
{
    int i,j;
    for(i=x;i<=n;i+=UB(i))
        for(j=y;j<=n;j+=UB(j))
            aib[i][j]=max(aib[i][j],sol+1);
}
void query(int x,int y)
{
    int i,j;
    for(i=x;i>0;i-=UB(i))
        for(j=y;j>0;j-=UB(j))
            sol=max(sol,aib[i][j]);
}
int main()
{
    freopen("cutii.in","r",stdin);
    freopen("cutii.out","w",stdout);
    scanf("%d %d\n",&n,&T);
    while(T--)
    {
        memset(aib,0,sizeof(aib));
        for(i=1;i<=n;i++)
            scanf("%d %d %d\n",&v[i].x,&v[i].y,&v[i].z);
        sort(v+1,v+n+1,cmp1);
        for(i=1;i<=n;i++)
        {
            sol=0;
            query(v[i].y,v[i].z);
            update(v[i].y,v[i].z);
        }
        query(n,n);
        printf("%d\n",sol);
    }
    return 0;
}