#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;
}
multiset<int> vals;
struct comp1
{
    bool operator()(int a, int b)
    {
        return v[a].second.first<v[b].second.first;
    }
};
struct comp2
{
    bool operator()(int a, int b)
    {
        return v[a].second.second<v[b].second.second;
    }
};
set<int,comp1> s1;
set<int,comp2> s2;
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);
    vals.clear();
    s1.clear();
    s2.clear();
    vals.insert(1);
    dp[n]=1;
    s1.insert(n);
    s2.insert(n);
    int ans=1;
    for(int i=n-1;i>=1;i--)
    {
        set<int> elim;
        for(auto it:s1)
        {
            int nr=it;
            if(v[nr].second.first<v[i].second.first)
            {
                elim.insert(nr);
                vals.erase(vals.find(dp[nr]));
            }
            else
                break;
        }
        for(auto it:s2)
        {
            int nr=it;
            if(v[nr].second.second<v[i].second.second&&elim.find(nr)==elim.end())
            {
                elim.insert(nr);
                vals.erase(vals.find(dp[nr]));
            }
            else
                break;
        }
        if(vals.empty())
            dp[i]=1;
        else
        {
            auto it=vals.end();
            it--;
            dp[i]=1+(*it);
            ans=max(ans,dp[i]);
        }
        for(auto q:elim)
        {
            vals.insert(dp[q]);
        }
        vals.insert(dp[i]);
        s1.insert(i);
        s2.insert(i);
    }
    fout<<ans<<'\n';
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    fin>>n>>t;
    while(t--)
        solve();
    return 0;
}