#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,t,i,maxi,dp[3509],aib[3509][3509];
struct str
{
    int x,y,z;
};
str a[3509];
bool cmp(str a,str b)
{
    return a.z<b.z;
}
int max(int a,int b)
{
    if(a>b) return a;
    return b;
}
void update(int p1,int p2,int val)
{
    int cp=p2;
    while(p1<=n)
    {
        p2=cp;
        while(p2<=n)
        {
            aib[p1][p2]=max(aib[p1][p2],val);
            p2=p2+(p2-(p2&(p2-1)));
        }
        p1=p1+(p1-(p1&(p1-1)));
    }
}
int query(int p1,int p2)
{
    int maxi=-1,cp=p2;
    while(p1>0)
    {
        p2=cp;
        while(p2>0)
        {
            if(aib[p1][p2]>maxi) maxi=aib[p1][p2];
            p2=p2-(p2-(p2&(p2-1)));
        }
        p1=p1-(p1-(p1&(p1-1)));
    }
    return maxi;
}
int main()
{
freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);
scanf("%d",&n);
scanf("%d",&t);
while(t)
{
    t--;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i].x);
        a[i].x++;
        scanf("%d",&a[i].y);
        a[i].y++;
        scanf("%d",&a[i].z);
        a[i].z++;
    }
    sort(a+1,a+n+1,cmp);
    memset(aib,0,sizeof(aib));
    maxi=0;
    for(i=1;i<=n;i++)
    {
        dp[i]=query(a[i].x-1,a[i].y-1)+1;
        update(a[i].x,a[i].y,dp[i]);
        if(dp[i]>maxi) maxi=dp[i];
    }
    printf("%d\n",maxi);
}
return 0;
}