#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

ifstream in("cutii.in");
ofstream out("cutii.out");
int N, T;

bool compare(vector<int> c1, vector<int> c2)
{
    return (c1[0]<c2[0] && c1[1]<c2[1] && c1[2]<c2[2]);
}

int main()
{
    in>>N>>T;
    for (int i=0; i<T; ++i)
    {
        vector< vector<int> > cutii;
        for (int j=0; j<N; ++j)
        {
            int x, y, z;
            in>>x>>y>>z;
            vector<int> cutie;
            cutie.push_back(x);
            cutie.push_back(y);
            cutie.push_back(z);
            cutii.push_back(cutie);
        }

        int sol = 0;
        sort(cutii.begin(), cutii.end(), compare);

        vector<int> cutie;
        cutie.push_back(cutii[0][0]);
        cutie.push_back(cutii[0][1]);
        cutie.push_back(cutii[0][2]);

        for (int j=1; j<N; ++j)
            if (cutie[0]<cutii[j][0] && cutie[1]<cutii[j][1] && cutie[2]<cutii[j][2])
            {
                ++sol;
                cutie = cutii[j];
            }

        out<<sol+1<<"\n";
    }

    return 0;
}