#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int N, T;

struct cutie {
  int x, y, z;
  cutie(int x, int y, int z) : x(x), y(y), z(z) { }
};

bool operator < (const cutie& a, const cutie& b) {
  return a.x < b.x && a.y < b.y && a.z < b.z;
}

void solve_test() {
  vector<cutie> cutii;

  // read
  for(int i = 0; i < N; ++i) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    cutii.push_back(cutie(x, y, z));
  }

  // sort
  sort(cutii.begin(), cutii.end());

  // longest increasing subsequence
  vector<cutie> lis;
  for(const auto& c : cutii) {
    auto it = lower_bound(lis.begin(), lis.end(), c);
    if(it != lis.end()) *it = c;
    else lis.push_back(c);
  }

  printf("%zu\n", lis.size());
}

int main(int argc, char *argv[]) {
  freopen("cutii.in", "r", stdin);
  freopen("cutii.out", "w", stdout);

  scanf("%d%d", &N, &T);
  while(T--) solve_test();

  return 0;
}