#include <algorithm>
#include <fstream>

using namespace std;

ifstream f("cutii.in");
ofstream g("cutii.out");

struct ceva{
    int h, l, c;
}a[3505];

int n, q, dp[3505];

bool cmp(ceva x, ceva y){
    return x.h < y.h;
}

int main()
{
    f >> n >> q;
    for(; q >= 1; q --)
    {
        for(int i = 1; i <= n; i ++)
            f >> a[i].h >> a[i].l >> a[i].c;

        sort(a + 1, a + n + 1, cmp);

        dp[1] = 1;
        for(int i = 2; i <= n; i ++)
            for(int j = i - 1; j >= 1; j --)
                if(a[i].l >= a[j].l && a[i].c >= a[j].c)
                    dp[i] = max(dp[i], dp[j] + 1);

        int maxi = 0;
        for(int i = 1; i <= n; i ++)
            maxi = max(maxi, dp[i]), dp[i] = 0;

        g << maxi << '\n';
    }
    return 0;
}