#include <bits/stdc++.h>

using namespace std;
ofstream g("cutii.out");
struct box
{
    int x,y,z;
};
int n, t, res;
int p = 31999;
char buffer[32010];
box v[3500];

void inc()
{
    ++p;
    if(p == 32000)
    {
        fread(buffer, 1, 32000, stdin);
        p = 0;
    }
}

void read(int &x)
{
    x = 0;
    while(buffer[p] < '0' || buffer[p] > '9')
        inc();
    while(buffer[p] >= '0' && buffer[p] <= '9')
    {
        x = x * 10 + buffer[p] - '0';
        inc();
    }
}

bool cmp(box b1,box b2)
{
    return (b1.x > b2.x && b1.y > b2.y && b1.z > b2.z);
}

void Solve()
{
    box last = v[0];
    res = 1;
    for(int i = 1;i < n;++i)
    {
        if(cmp(last, v[i]))
        {
            ++res;
            last = v[i];
        }
    }
    g<<res<<'\n';
}

void Read()
{
    freopen("cutii.in","r",stdin);
    read(n);
    read(t);
    for(int i = 1;i <= t;++i)
    {
        for(int j = 0;j < n;++j)
            {
                read(v[j].x);
                read(v[j].y);
                read(v[j].z);
            }
        sort(v, v + n,cmp);
        Solve();
    }
    g.close();
}

int main()
{
    Read();
    return 0;
}