#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 300;
int arr[N][N];
pair<int, int> rev[N*N];
int rdist[N][2];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int h, w;
	cin >> h >> w;
	for (int y = 0; y < h; ++y) {
		for (int x = 0; x < w; ++x) {
			cin >> arr[y][x];
			--arr[y][x];
			rev[arr[y][x]] = {y, x};
		}
	}

	for (int v = 0; v < h*w; ++v) {
		int ty = rev[v].first;
		int tx = rev[v].second;

		for (int x = 0; x < w; ++x) {
			for (int j = 0; j <= 1; ++j) {
				int dir = (j == 0 ? 1 : -1);
				for (rdist[x][j] = 0;; ++rdist[x][j]) {
					int y = (ty + rdist[x][j] * dir);
					if (y < 0 || y >= h || arr[y][x] < v) break;
				}
			}
		}

		ll res = 0;
		int le_d0 = h, le_d1 = h;
		for (int x0 = tx; x0 >= 0; --x0) {

			le_d0 = min(le_d0, rdist[x0][0]);
			le_d1 = min(le_d1, rdist[x0][1]);

			int ri_d0 = h, ri_d1 = h;
			for (int x1 = tx; x1 < w; ++x1) {
				ri_d0 = min(ri_d0, rdist[x1][0]);
				ri_d1 = min(ri_d1, rdist[x1][1]);

				ll add = (ll)min(le_d0, ri_d0) * min(le_d1, ri_d1);
				res += add;
			}
		}
		cout << res << '\n';
	}
	
}