#include <bits/stdc++.h>
using namespace std;

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

int n,t;
int dp[3501];
vector<int> v[3];

int main() {
    
    fin >> n >> t;
    
    for (int i = 1; i<=t; i++) {
        int nrmax = 1;
        int a, b, c;
        for (int j = 1; j<=n; j++) {
            v[j].clear();
            fin >> a >> b >> c;
            v[j].push_back(a);
            v[j].push_back(b);
            v[j].push_back(c);
            
            sort(v[j].begin(), v[j].end());
        }
        
        sort(v+1, v+n+1);
        
        /*for (int j = 1; j<=n; j++) {
            cout << v[j][0] << " " << v[j][1] << " " << v[j][2] << endl;
        }*/
        
        dp[1] = 1;
        for (int j = 2; j<=n; j++) {
            dp[j] = 1;
            for (int k = 1; k<=j; k++) {
                if (v[k][0] < v[j][0] && v[k][1] < v[j][1] && v[k][2] < v[j][2]) {
                    dp[j] = max(dp[j], dp[k]+1);
                }
            }
            
            nrmax = max(nrmax, dp[j]);
        }
        
        fout << nrmax << endl;
    }
    
    return 0;
}