#include <fstream>
#include <algorithm>
using namespace std;

struct cutie
{
    int x,y,z;
} v[3501];
inline bool regula(cutie a,cutie b)
{
    return (a.z < b.z);
}
int a[3501],n,i,j,k,t;
int main()
{
    ifstream cin ("cutii.in");
    cin>>n>>t;
    ofstream cout ("cutii.out");

    for(k = 0; k < t; k++)
    {
        for(i = 1; i <= n; i++)
        {
            cin >> v[i].x >> v[i].y >> v[i].z;
        }
        sort(v+1,v+n+1,regula);
        int max = 1;
        for(i = 1; i <= n; i++)
        {
            a[i] = 1;
        }
        for(i = n-1; i > 0; i--)
        {
            for(j = i+1; j <= n; j++)
            {
                if(v[j].x > v[i].x && v[j].y > v[i].y && v[j].z > v[i].z && a[i] < a[j] + 1)
                {
                    a[i] = a[j] + 1;
                    if(a[i] > max)
                        max = a[i];
                }
            }
        }
        cout << max << "\n";
    }
    cout.close();
    return 0;
}