#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
typedef struct
{
    long x,y,z;
} cutii;
int z_cmp(const void *p1, const void *p2)
{
    cutii *q1 = (cutii*)p1;
    cutii *q2 = (cutii*)p2;
    if ((*q1).z>(*q2).z)
        return 1;
    else if ((*q1).z<(*q2).z)
        return -1;
    else return 0;
}
int main()
{
    ifstream f("cutii.in");
    ofstream g("cutii.out");
    if (!f.is_open())
        return 404;
    if (!g.is_open())
        return 404;
    long n,t;
    cutii a[30];
    f>>n>>t;
    while (t!=0)
    {
        int q=1;
        for (int i=0; i<n; i++)
            f>>a[i].x>>a[i].y>>a[i].z;
        qsort(a,n,sizeof(cutii),z_cmp);
        for (int i=0; i<n-1; i++)
        {
            if ((a[i].x<a[i+1].x)&&(a[i].y<a[i+1].y)&&(a[i].z<a[i+1].z))
                q=q+1;
            else
                break;
        }
        g<<q<<"\n";
        t= t-1 ;
    }
    return 0;
}