#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;
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;
}
void update(int x, int y, int val)
{
    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], val);
}
int query(int x, int y)
{
    int s = -1;
    for(int i = x; i > 0; i -= i & -i)
        for(int j = y; j > 0; j -= j & -j)
            s = Max(s, aib[i][j]);
    return s;
}
bool cmp(const nod a, const nod b)
{
    if(a.x == b.x)
    {
        if(a.y == b.y)
            return a.z < b.z;
        return a.y < b.y;
    }
    return a.x < b.x;
}
int solve()
{
    int sol = -1, l;
    l = aib[v[1].y][v[1].z] = 1;
    update(v[1].y, v[1].z, l + 1);
    for(int i = 2; i <= n; ++ i)
    {
        l = query(v[i].y, v[i].z);
        sol = Max(sol, l);
        update(v[i].y, v[i].z, l + 1);
    }
    printf("%d\n", sol);
}
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();
        solve();
    }
    return 0;
}