#include <iostream>
#include <vector>
using namespace std;

bool g[201][201];
int dis[201][201];

int main() {
	int n, m, k; cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (i != 1) g[(i - 1) * m + j][(i - 2) * m + j] = true;
			if (i != n) g[(i - 1) * m + j][i * m + j] = true;
			if (j != 1)g[(i - 1) * m + j][(i - 1) * m + j - 1] = true;
			if(j!=m)g[(i - 1) * m + j][(i - 1) * m + j + 1] = true;
		}
	}
	for (int i = 1; i <= n*m; i++) {
		for (int j = 1; j <= n * m; j++) {
			if (g[i][j])dis[i][j] = 1;
			else dis[i][j] = 100000;
			if (i == j)dis[i][j] = 0;
		}
	}
	for (int x = 1; x <= n * m; x++) {
		for (int i = 1; i <= n * m; i++) {
			for (int j = 1; j <= n * m; j++) {
				dis[i][j] = min(dis[i][j], dis[i][x] + dis[x][j]);
			}
		}
	}
	for (int i = 1; i <= n * m; i++) {
		for (int j = 1; j <= n * m; j++) {
			cout << dis[i][j] << ' ';
		}
		cout << '\n';
	}
	while (k--) {
		int u, v; cin >> u >> v;
		for (int i = 1; i <= n * m; i++) {
			for (int j = 1; j <= n * m; j++) {
				dis[i][j] = min(dis[i][j], min(dis[i][u] + dis[v][j] + 1, dis[i][v] + dis[u][j] + 1));
				dis[j][i] = min(dis[i][j], min(dis[i][u] + dis[v][j] + 1, dis[i][v] + dis[u][j] + 1));
			}
		}
		int maxe = 0;
		for (int i = 1; i <= n * m; i++) {
			for (int j = 1; j <= n * m; j++) {
				if (i != j)maxe = max(maxe, dis[i][j]);
			}
		}
		cout << maxe << '\n';
	}
}