#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;
}
struct comp
{
    bool operator()(int a, int b)
    {
        return v[a].second.first>v[b].second.first;
    }
};
set<int,comp> s;
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;
    int ans=1;
    s.clear();
    s.insert(n);
    for(int i=n-1;i>=1;i--)
    {
        int maxim=0;
        int nums=0;
        for(auto nr:s)
        {
            nums++;
            if(v[nr].second.first<v[i].second.first)
                break;
            if(v[nr].second.second>v[i].second.second)
                maxim=max(maxim,dp[nr]);
            if(n*nums*t>1e7)
                break;
        }
        dp[i]=maxim+1;
        ans=max(ans,dp[i]);
        s.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;
}