#include <bits/stdc++.h>
#define Nmax 3502
FILE *fin  = freopen("cutii.in", "r", stdin);
FILE *fout = freopen("cutii.out", "w", stdout);

using namespace std;
int n, t, s;
short int aib[Nmax][Nmax];
struct nod {int x, y, z;};
nod v[Nmax];
int Max(int x, int y)
{
    if(x > y)
        return x;
    return y;
}
bool cmp(const nod &a,const nod &b)
{
    if (a.x == b.x) return a.y * a.z < b.y * b.z; else
       return a.x < b.x;
}
void update(int x, int y)
{
    for(int i = x; i <= n; i += i & -i)
        for(int j = y; j <= n; j += j & -j)
            aib[i][j] = Max(aib[i][j], s + 1);
}
void query(int x, int y)
{
    for(int i = x; i > 0; i -= i & -i)
        for(int j = y; j > 0; j -= j & -j)
            s = Max(s, aib[i][j]);
}
int solve()
{
    for(int i = 1; i <= n; ++ i)
    {
        s = 0;
        query(v[i].y, v[i].z);
        update(v[i].y, v[i].z);
    }
    query(n, n);
    printf("%d\n", s);
}
void read()
{
    memset(v ,0, sizeof(v));
    for(int i = 1; i <= n; ++ i)
        scanf("%d %d %d", &v[i].x, &v[i].y, &v[i].z);
}
int main()
{
    int i, j;
    scanf("%d %d", &n, &t);
    while(t --)
    {
        memset(aib, 0, sizeof(aib));
        read();
        sort(v + 1, v + n + 1, cmp);
        solve();
    }
    return 0;
}