#include <iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<deque>
#define ll long long
#define mod 998244353
#define sc(A) scanf("%d",&A)
#define rep(A,B,C) for(int C=A;C<=B;++C)
#define fep(A,B,C) for(int C=A;C>=B;--C)
#define put(x) printf("%d\n",x)
#define db double
using namespace std;
const int MAXN=510,maxn=77;
int n,m,x,maxx=62,top;
int a[MAXN][MAXN];
int f[MAXN][MAXN],F[MAXN];
int g[MAXN][MAXN],G[MAXN];
ll w[MAXN*MAXN];
struct wy{int l,r;}s[MAXN*MAXN];
signed main() 
{
	//freopen("1.in","r",stdin);
	sc(n);sc(m);
	
	rep(1,n,i)rep(1,m,j)
	{
		sc(s[(i-1)*m+j].l);
		sc(s[(i-1)*m+j].r);
	}

	fep(n*m,1,W)
	{
		int x=s[W].l;
		int y=s[W].r;
		int cnt=0;
		a[x][y]=1;
		while(a[x-cnt-1][y])++cnt;
		f[x][y]=cnt;
		cnt=0;
		while(a[x+cnt+1][y])++cnt;
		g[x][y]=cnt;

		F[y]=f[x][y];
		int minn=f[x][y];
		rep(y+1,m,j)
		{
			minn=min(minn,f[x][j]);
			F[j]=minn;
		}
		minn=f[x][y];
		fep(y-1,1,j)
		{
			minn=min(minn,f[x][j]);
			F[j]=minn;
		}
		G[y]=g[x][y];
		minn=g[x][y];
		rep(y+1,m,j)
		{
			minn=min(minn,g[x][j]);
			G[j]=minn;
		}
		minn=g[x][y];
		fep(y-1,1,j)
		{
			minn=min(minn,g[x][j]);
			G[j]=minn;
		}
		ll ans=0;
		fep(y,1,i)
		{
			if(!a[x][i])break;
			rep(y,m,j)
			{
				if(!a[x][j])break;
				int L=min(F[i],F[j]);
				int R=min(G[i],G[j]);
				ans+=(L+1)*(R+1);
			}
		}
		w[W]=w[W+1]+ans;
		
		cnt=0;
		while(a[x-1-cnt][y])f[x-1-cnt][y]=f[x-cnt][y]+1,++cnt;
		cnt=0;
		while(a[x+1+cnt][y])g[x+1+cnt][y]=g[x+cnt][y]+1,++cnt;
	}
	rep(1,n*m,i)printf("%lld\n",w[i+1]);
	return 0;
}