#include <bits/stdc++.h>
#define pb push_back

using namespace std;

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

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 3510;

struct nume{
    int x,y,z;
};

nume V[DMAX];
int dp[DMAX][DMAX];

int n;

inline bool operator<(nume x,nume y){
    if(x.x == y.x && x.y == y.y)
        return x.z<y.z;
    if(x.x == y.x)
        return x.y<y.y;
    return x.x<y.x;
}

int aib(int i){
    return ((i)&(-i));
}

void update(int x,int y,int val);
int query(int x,int y);
void resetaib(int x,int y);

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,i;
    int ans,acm;

    fin>>n>>t;
    while(t--){
        for(i=1;i<=n;i++)
            fin>>V[i].x>>V[i].y>>V[i].z;
        sort(V+1,V+n+1);
        ans=0;
        for(i=1;i<=n;i++){
            acm=query(V[i].y-1,V[i].z-1);
            ans=max(ans,acm+1);
            update(V[i].y,V[i].z,acm+1);
        }
        fout<<ans<<'\n';
        for(i=1;i<=n;i++)
            resetaib(V[i].y,V[i].z);
    }

    return 0;
}
void update(int x,int y,int val){
     int i,j;
     for(i=x;i<=n;i+=aib(i))
        for(j=y;j<=n;j+=aib(j))
            dp[i][j]=max(dp[i][j],val);
}
int query(int x,int y){
    int i,j;
    int ans=0;
    for(i=x;i>0;i-=aib(i))
        for(j=y;j>0;j-=aib(j))
            ans=max(dp[i][j],ans);
    return ans;
}
void resetaib(int x,int y){
    int i,j;
     for(i=x;i<=n;i+=aib(i))
        for(j=y;j<=n;j+=aib(j))
            dp[i][j]=0;
}