#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, m;
    cin >> n >> m;
    int ma[m] = {};
    int cnt[n] = {};
    int ans = 0;
    int a[n][m];
    rep(i,n)rep(j,m) cin >> a[i][j];
    stack<int> st[m];
    rep(i,n){
        rep(j,m){
            if(a[i][j] > ma[j]){
                while(st[j].size() > 0){
                    int x = st[j].top();
                    st[j].pop();
                    cnt[x]--;
                    if(cnt[x]==0) ans--;
                }
                ma[j] = a[i][j];
                st[j].push(i);
                cnt[i]++;
                if(cnt[i] == 1) ans++;
            }else if(a[i][j] == ma[j]){
                st[j].push(i);
                cnt[i]++;
                if(cnt[i] == 1) ans++;
            }
        }
        cout << ans << endl;
    }
    return 0;
}