#include <fstream>

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

short N,T,t[3501][3];
int q[3501];

void sortr(int q[], short t[][3],short N){

    for(short i=1;i<N;i++)
        for(short j=i+1;j<=N;j++)
            if(q[i]>q[j])
                swap(q[i],q[j]),swap(t[i][1],t[j][1]),swap(t[i][2],t[j][2]),swap(t[i][3],t[j][3]);

}

int check(int q[], short t[][3],short N){
    sortr(q,t,N);
    int l=1,p=N;
    for(short i=N-1;i>=1;i--)
        if(q[p]>q[i] && t[p][1]>t[i][1] && t[p][2]>t[i][2] && t[p][3]>t[i][3])
                    l++,p=i;
    return l;
}

int main(){
    f>>N>>T;
    for(short i=1;i<=T;i++){
        for(short k=1;k<=N;k++){
            f>>t[k][1]>>t[k][2]>>t[k][3];
            q[k]+=t[k][1]+t[k][2]+t[k][3];

    }
    g<<check(q,t,N);
    }
}