# include <bits/stdc++.h>
using namespace std;
ifstream fi("cutii.in");
ofstream fo("cutii.out");
struct cc
{
    int x,y,z;
} s[3505];
int d[3505];
bool comp(cc a,cc b)
{
    return (a.x > b.x && a.y > b.y && a.z > b.z);
}
bool cmp(cc a,cc b)
{
    return (a.x != b.x ? a.x<b.x:a.y!=b.y ? a.y<b.y:a.z<b.z);
}
int main(void)
{
    int n,t;
    fi>>n>>t;
    while (t --)
    {
        for (int i=1;i<=n;++i)  fi>>s[i].x>>s[i].y>>s[i].z;
        sort(s+1,s+1+n,cmp);
        for (int i=1;i<=n;++i) d[i]=1;
        for (int i=1;i<=n;++i) for (int j=i-1;j;--j) if (comp(s[i],s[j])) d[i]=max(d[i],d[j]+1);
        fo << d[max_element(d+1,d+1+n) - d] << '\n';
    }
    return 0;
}