#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);

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

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

    return 0;
}