#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
#define ll long long

const int INF = 1e9;
const long long LLINF = 1e18;

using namespace std;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
int dy8[] = {0,1,1,1,0,-1,-1,-1};
int dx8[] = {1,1,0,-1,-1,-1,0,1};

/*==================================================*/
/*variable*/
int N, M;
int R[100010][20];

int d[100010];
stack< pair<int, int> > stk[15];  //値、番号
/*==================================================*/
/*function*/

/*==================================================*/

int main() {
    cin>>N>>M;

    int cnt = 0;

    REP(i,0,N){
        REP(j,0,M){
            int r;
            cin>>r;
            if(!stk[j].empty()){
                if(r > stk[j].top().first){
                    while(!stk[j].empty()) {
                        d[stk[j].top().second]--;
                        if(d[stk[j].top().second] == 0) cnt--;
                        stk[j].pop();
                    }
                    d[i]++;
                    if(d[i] == 1) cnt++;
                    stk[j].push({r, i});
                }else if(r == stk[j].top().first){
                    d[i]++;
                    if(d[i] == 1) cnt++;
                    stk[j].push({r, i});
                }
            }else{
                d[i]++;
                if(d[i] == 1) cnt++;
                stk[j].push({r, i});
            }
        }
        cout<<cnt<<endl;
    }

    return 0;
}