#include<iostream>
#include<vector>
#include<set>
using namespace std;

int main(){
    int n, m, r;
    scanf("%d %d", &n, &m);

    vector<pair<int,vector<int>>> p(10);

    for(int i = 0; i < m; i++){
        scanf("%d", &r);
        p[i] = {r, vector<int>(1, 0)};
    }
    printf("1\n");

    for(int i = 1; i < n; i++){
        for(int j = 0; j < m; j++){
            scanf("%d", &r);
            if(r > p[j].first){
                p[j].second.clear();
                p[j].second.push_back(r);
                p[j].first = r;
            }else if(r == p[j].first){
                p[j].second.push_back(r);
            }
        }
        set<int> candidate;
        for(int j = 0; j < m; j++){
            for(int x : p[j].second)    candidate.insert(x);
        }
        printf("%d\n", candidate.size());
    }

    return 0;
}