#include <fstream>
#include <vector>
#include <tuple>
#include <algorithm>

#define mt make_tuple
using namespace std;

ifstream cin ("cutii.in");
ofstream cout ("cutii.out");

const int N = 3500;
int dp[N + 1];

using tu = tuple <int, int, int>;

int t, n, x, y, z;

int cb (int st, int dr, int val, vector <tu> v)
{
    int mid, last = -1;
    while (st <= dr)
    {
        int mid = (st + dr) >> 1;
        if (val <= get<0>(v[mid]))
        {
            last = mid;
            dr = mid - 1;
        }
        else
            st = mid + 1;
    }
    return last;
}

void solve ()
{
    vector <tu> v;
    for (int i = 1; i <= n && cin >> x >> y >> z; ++i)v.push_back(mt(x, y, z));
    sort (v.begin(), v.end(), [](const tu &a, const tu &b)
    {
        return get<2>(a) < get<2>(b);
    });
    for (int i = 0; i < n; ++i)
        dp[i] = 1;
    for (int i = n - 1; i >= 0; --i)
    {
        tie (x, y, z) = v[i];
        int indice = cb (0, n - 1, x, v);
        int val = dp[i];
        for (int j = indice; j < n; ++j)
            if (j != i)
                if (get<1>(v[j]) >= y && get<2>(v[j]) >= z)dp[i] = max (dp[i], val + dp[j]);
    }
    int mx = 1;
    for (int i = 0; i < n; ++i)
        mx = max (mx, dp[i]);
    cout << mx << '\n';
}

int main()
{
    for (cin >> n >> t; t; --t)
        solve();
    return 0;
}