#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
#include <array>
#include <numeric>
#include <regex>
#include <bitset>
#include <deque>

using namespace std;
typedef long long ll;
typedef pair<int, int> p_ii;

const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;

int N,M,R[100010][10];

int main() {
    stack<int>t[10];
    int pp[100010], res=0;
    cin>>N>>M;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            cin>>R[i][j];
            while(!t[j].empty()&&R[t[j].top()][j]<R[i][j]){
                if(--pp[t[j].top()]==0)res--;
                t[j].pop();
            }
            if(t[j].empty()||R[t[j].top()][j]==R[i][j]){
                if(++pp[i]==1)res++;
                t[j].push(i);
            }
        }
        cout<<res<<endl;
    }
    

    return 0;
}