#include <iostream>
#include <fstream>

using namespace std;

int n,t,lis[3501];
long long x[3501],maxx;

int main()
{
    int i,j,a;
    freopen("cutii.in","r",stdin);
    freopen("cutii.out","w",stdout);
    cin>>n>>t;
    while(t>0)
    {
        for(i=1;i<=n;i++)
        {
            x[i]=1;
            cin>>a;
            x[i]*=a;
            cin>>a;
            x[i]*=a;
            cin>>a;
            x[i]*=a;
        }
        lis[n]=1;
        for(i=n-1;i>=1;i--)
        {
            maxx=0;
            for(j=i+1;j<=n;j++)
            {
                if(x[i]<x[j] && maxx<lis[j])
                {
                    maxx=lis[j];
                }
            }
            lis[i]=maxx+1;
        }
        maxx=1;
        for(i=1;i<=n;i++)
        {
            if(maxx<lis[i])
                maxx=lis[i];
        }
        cout<<maxx<<"\n";
        t--;
    }
    return 0;
}