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

ifstream cin("cutii.in");
ofstream cout("cutii.out");

int t, n, i, j, nr, vf;

struct nanu {
    int x, y, z;
}v[3501], st[3501];

bool cmp(nanu a, nanu b) {
    return a.x > b.x || (a.x == b.x && a.y > b.y) || (a.x == b.x && a.y == b.y && a.z > b.z);
}

int main() {
    cin >> n >> t;
    
    while(t--) {
        for(i = 1; i <= n; i++)
            cin >> v[i].x >> v[i].y >> v[i].z;

        sort(v + 1, v + n + 1, cmp);
        vf = 0;
        st[++vf] = {v[1]};
        for(i = 2; i <= n; i++) {
            if(st[vf].x > v[i].x && st[vf].y > v[i].y && st[vf].z > v[i].z)
                st[++vf] = {v[i]};
        }
        cout << vf << '\n';
    }

    return 0;
}