#include<cstdio>
#include<algorithm>
using namespace std;
struct R
{
    int x,y,z;
}r[3501];
int n,l,i,b[3501],c[3501],d[3501],e[3501],x1,x2,x3,x4;

inline bool A(R a,R b)
{
    return a.x<b.x;
}

inline int S(int f[])
{
    int m=0,g[3501]={0},i,j,k;
    for(i=1;i<=n;i++)
    {
         if(f[g[m]]<f[i])
             g[++m]=i;
         for(j=0,k=m;j<k;)
         if(f[g[(j+k)/2]]<f[i])
             j=(j+k)/2+1;
         else
             k=(j+k)/2;
         if(f[i]<f[g[j]])
             b[j]=i;            
    }
    return m;
}

int main()
{
    freopen("cutii.in","r",stdin),
    freopen("cutii.out","w",stdout),
    scanf("%d%d",&n,&l);
    while(l--)
    {
          for(i=1;i<=n;i++)
                scanf("%d%d%d",&r[i].x,&r[i].y,&r[i].z);
          sort(r+1,r+n+1,A);
          for(i=1;i<=n;i++)
                b[i]=r[i].y,c[i]=r[i].z,d[i]=r[i].y+r[i].z,e[i]=r[i].y*r[i].z;
          printf("%d\n",min(min(S(b),S(c)),min(S(d),S(e))));
                
    }
}