program cutii;
type cutie = record
                a,b,c : integer;
                end;
var A : array [1..3500] of cutie;
    m,T,N,i,j : integer;
    f,g : text;



function cuib(x:integer):integer;
var v : integer;
    D : cutie;
begin
v := 1;
D := A[v];
m := m+1;
repeat
v := v+1;
if (A[v].a<D.a) and (A[v].b<D.b) and (A[v].c<D.c) then begin
                                                        D.a := A[v].a;
                                                        D.b := A[v].b;
                                                        D.c := A[v].c;
                                                        m := m+1;
                                                        end;
until v=x;



end;

procedure sort(x : integer);
var p : cutie;
    ok : boolean;
begin

repeat
ok := true;
for i := 1 to x-1 do
if A[i].c<A[i+1].c then begin
                        p := A[i];
                        A[i] := A[i+1];
                        A[i+1] := p;
                        ok := false;
                        end;
until ok;

repeat
ok := true;
for i := 1 to x-1 do
if A[i].b<A[i+1].b then begin
                        p := A[i];
                        A[i] := A[i+1];
                        A[i+1] := p;
                        ok := false;
                        end;
until ok;

repeat
ok := true;
for i := 1 to x-1 do
if A[i].a<A[i+1].a then begin
                        p := A[i];
                        A[i] := A[i+1];
                        A[i+1] := p;
                        ok := false;
                        end;
until ok;


end;
begin
assign(f,'cutii.in');
reset(f);

readln(f,N,T);

assign(g,'cutii.out');
rewrite(g);

for j := 1 to T do begin

for i := 1 to N do
readln(f,A[i].a,A[i].b,A[i].c);

m := 0;
sort(n);
cuib(n);

writeln(g,m);

end;

close(f);
close(g);

end.