#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("cutii.in");
ofstream out("cutii.out");
int n,i,l[3501],L[3501],h[3501],maxi,s[3501],t,c[3501],d[3501];

int crescator(int i)
{
    if(i==1)return 1;
    if(l[i]>l[i-1]&&L[i]>L[i-1] &&h[i]>h[i-1])
        return crescator(i-1)+1;
}
int descrescator(int i)
{
 if(i==1)return 1;
    if(l[i]<l[i-1]&&L[i]<L[i-1] &&h[i]<h[i-1])
        return crescator(i-1)+1;
}
int main()
{int j=1;
    in>>n>>t;
    for(j=1;j<=t;j++)
    {for(i=1;i<=n;i++)
       in>>l[i]>>L[i]>>h[i];

    for(i=1;i<=n;i++)
        {
            c[i]=crescator(i);
            d[i]=descrescator(i);
        }
    sort(c+1,c+n+1);
    sort(d+1,d+n+1);
    out<<max(c[n],d[n])<<'\n';
    }

    return 0;
}