#include<fstream>
#include<algorithm>
#define DIM 3505
#define x first
#define y second.first
#define z second.second
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
int T,n,i,t[DIM],w[DIM],nr;
pair<int, pair<int,int> > p[DIM];
int compar( pair<int, pair<int,int> > a , pair<int, pair<int,int> > b ){
    if( a.x > b.x && a.y > b.y && a.z > b.z )
        return 1;
    else
        return 0;
}
int main(){
    fin >> n >> T;
    for( ; T != 0; T-- ){
        //citire
        for( i = 1; i <= n; i++ ){
            fin >> p[i].x >> p[i].y >> p[i].z;
        }
        sort( p + 1, p + n + 1 );
        //scmax
        t[1] = 0;
        w[1] = 1;
        nr = 1;
        for( i = 2; i <= n ; i++ ){
            if( compar( p[i] , p[ w[nr] ] ) == 1 ){
                t[i] = w[nr];
                w[ ++nr ] = i;
            }else{
                int p1 = 1;
                int u = nr;
                while( p1 <= u ){

                    int mid = ( p1 + u ) / 2;

                    if( compar( p[i] , p[ w[mid] ] ) == 1 ){
                        p1 = mid + 1;
                    }else{
                        u = mid - 1;
                    }
                }
                if( compar( p[i] , p[ w[u] ] ) == 1 ){
                    t[i] = w[u];
                    w[p1] = i;
                }
            }
        }
        fout << nr << "\n";
    }
    return 0;
}