#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("cutii.in");
ofstream fout("cutii.out");

struct box{
             int a, b, c;
          }v[4001];

int n, t, dp[4001];

bool mycmp(box x, box y)
{
    return x.a<y.a;
}

bool check(box x, box y)
{
    return x.a<y.a&&x.b<y.b&&x.c<y.c;
}

int main()
{
    fin>>n>>t;
    while(t--)
    {
        for(int i=1;i<=n;++i) fin>>v[i].a>>v[i].b>>v[i].c;
        sort(v+1, v+n+1, mycmp);
        dp[1]=1;
        int maxi=0;
        for(int i=2;i<=n;++i)
        {
            dp[i]=1;
            for(int j=i-1;j>=0;--j)
                if(check(v[j], v[i])) dp[i]=max(dp[i], dp[j]+1);
            if(dp[i]>maxi) maxi=dp[i];
        }
        fout<<maxi<<"\n";
    }
    return 0;
}