#include <fstream>

#include <algorithm>

using namespace std;

int n,i,d,x,y,z,maxim,ap,t,j;

pair < pair <int, int> , pair <int, int> > v[3510];

ifstream fin ("cutii.in");

ofstream fout ("cutii.out");

int main (){

    fin>>n>>t;
    for (d=1;d<=t;d++){
        for (i=1;i<=n;i++)
            fin>>v[i].first.first>>v[i].first.second>>v[i].second.first;
        sort (v+1,v+n+1);
        maxim = 0;
        for (i=1;i<n;i++){
            x = v[i].first.first;
            y = v[i].first.second;
            z = v[i].second.first;
            ap = 1;
            for (j=i+1;j<=n;j++){
                if (v[j].first.first > x && v[j].first.second > y && v[j].second.first > z){
                    ap++;
                    x = v[j].first.first;
                    y = v[j].first.second;
                    z = v[j].second.first;
                }
            }
            if (ap > maxim)
                maxim = ap;
        }
        fout<<maxim<<"\n";
    }

    return 0;
}