#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("cutii.in");
ofstream fout("cutii.out");

#define DIM 3500

int n, t;
pair<int, pair<int, int>> v[DIM + 1];

int main() {
  fin >> n >> t;
  while(t--) {
    for(int i = 1; i <= n; i++) 
      fin >> v[i].first >> v[i].second.first >> v[i].second.second;
    sort(v + 1, v + n + 1);
    
    int maxim = 1, ult = n; //retin indicele ultimei cutii puse;
    for(int i = n - 1; i >= 1; i--) {
      int x = v[ult].first;
      int y = v[ult].second.first;
      int z = v[ult].second.second;
      if(x > v[i].first && y > v[i].second.first && z > v[i].second.second) {
        maxim++;
        ult = i;
      }
    }
    fout << maxim << '\n';
  }

  return 0;
}