#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=998244353 ;
int dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;

int main(){
    int n,m;
    cin>>n>>m;
    int a[n][m];
    int ma[m][n];
    rep(i,m)rep(j,n)ma[i][j]=0;
    rep(i,n)rep(j,m){
        cin>>a[i][j];
        ma[j][i]=a[i][j];
        if(i>0)ma[j][i]=max(ma[j][i-1],ma[j][i]);
    }
    int ans[n+1];
    rep(i,n)ans[i]=1;
    rep(i,n){
        int ret=i;
        rep(j,m){
            int x=upper_bound(ma[j],ma[j]+n,a[i][j])-ma[j];
            ret=max(x,ret);
        }
        ans[ret]--;
    }
    rep(i,n)ans[i+1]+=ans[i];
    rep(i,n)cout<<ans[i]<<endl;
    return 0;
}