#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
pair<int,pii> v[4001];
int n,dp[4001],t;
bool cmp(pair<int,pii> a, pair<int,pii> b)
{
    return a.first<b.first;
}
void solve()
{
    for(int i=1;i<=n;i++)
    {
        fin>>v[i].first>>v[i].second.first>>v[i].second.second;
        dp[i]=0;
    }
    sort(v+1,v+n+1,cmp);
    dp[n]=1;
    vector<int> val[3501];
    val[1].push_back(n);
    int ans=1;
    for(int i=n-1;i>=1;i--)
    {
        int st=1;
        int dr=n;
        int maxim=0;
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            bool found=0;
            for(auto q:val[mij])
                if(v[q].first>v[i].first&&v[q].second.first>v[i].second.first&&v[q].second.second>v[i].second.second)
                {
                    found=1;
                    break;
                }
            if(found)
            {
                maxim=max(maxim,mij);
                st=mij+1;
            }
            else
                dr=mij-1;
        }
        dp[i]=maxim+1;
        ans=max(ans,dp[i]);
        val[dp[i]].push_back(i);
    }
    fout<<ans<<'\n';
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fout.tie(0);
    fin>>n>>t;
    while(t--)
        solve();
    return 0;
}