#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

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

const int nMax=1e6+5;
ll n , t , nr , rez;
struct numar
{
    ll x , y , z;
}a[nMax];

bool cmp(numar a , numar b)
{
    return a.x*a.y*a.z<b.x*b.y*b.z;
}

bool verif(numar a , numar b)
{
    if(a.x>=b.x && a.y>=b.y && a.z>=b.z) return true;
    return false;
}

void solve()
{
    for(int i=1;i<=n;i++)f >> a[i].x >> a[i].y >> a[i].z;
    sort(a+1 , a+n+1 , cmp);
    ll nr=1;
    numar x=a[n];
    for(int i=n-1;i>=1;i--){
        if(verif(x , a[i])==true) x=a[i] , nr++;
    }
    g << nr << '\n';
}

int main()
{
    ios_base::sync_with_stdio(NULL);
    f >> n >> t;
    while(t){
        t--;
        solve();
    }
}