#include<bits/stdc++.h>
using namespace std;
long long n, m, b, L, maxx = -1;
int main() {
	cin >> n >> m;
	long long a[n + 3][m + 3] = {0}, c[n + 3][m + 3] = {0};
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			b = a[i][j];
			for (int l = 1; l <= n; l++) {
				for (int o = 1; o <= m; o++) {
					if (l == i && o == j) {
						continue;
					}
					
					if (a[l][o] == b) {
						L = ((i - l) * (i - l)) + ((j - o) * (j - o));
						if (L > maxx) {
							maxx = L;
						}
					}
					c[i][j] = maxx;
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout << c[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}