#include <iostream>
#include <cstdio>
#include <vector>
#define ll long long
using namespace std;
int n,m,a[305][305];
int x[100005],y[100005];
int book[305][305];
int ans[100005];
int id[305][305],id_tot;
struct DSU{
	int book[305];
	int dsu[305],sz[305];
	int dsu_find(int x){
		while(x!=dsu[x])x=dsu[x]=dsu[dsu[x]];
		return x;
	}
	void build(){
		for (int i=1;i<=m;i++)book[i]=0,dsu[i]=i,sz[i]=1;
		return;
	}
	int add(int x){
		book[x]=1;
		int p0=1,p1=1;
		if (x>1&&book[x-1]==1){
			int qwq=x-1;
			p0+=sz[qwq];
			dsu[qwq]=x;
			sz[x]+=sz[qwq],sz[qwq]=0;
		}
		if (x<m&&book[x+1]==1){
			int qwq=dsu_find(x+1);
			p1+=sz[qwq];
			dsu[x]=qwq;
			sz[qwq]+=sz[x],sz[x]=0;
		}
		return p0*p1;
	}
}dsu;
int ins[305][305][305],l[305][305];
int main(){
	cin>>n>>m;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++){
			scanf("%d",&a[i][j]);
			x[a[i][j]]=i;
			y[a[i][j]]=j;
		}
	for (int i=1;i<=n;i++)
		for (int j=i;j<=n;j++)
			id[i][j]=++id_tot;
	for (int i=n*m;i>=1;i--){
		int _x=x[i],_y=y[i];
		book[_x][_y]=1;
		for (int j=_x;j>=1;j--){
			if (book[j][_y]==0)break;
			for (int k=_x;k<=n;k++){
				if (book[k][_y]==0)break;
				ins[j][k][++l[j][k]]=i;
			}
		}
	}
	for (int i=1;i<=n;i++)
		for (int j=i;j<=n;j++){
			dsu.build();
			for (int k=1;k<=m;k++)
				ans[ins[i][j][k]]+=dsu.add(y[ins[i][j][k]]);
		}
	for (int i=1;i<=n*m;i++)printf("%d\n",ans[i]);
	return 0;
}