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

#define int long long
#define double long double

#define pii pair<int, int>

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifdef CB
	freopen("be2.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
#endif
	int N, M, K;
	cin >> N >> M >> K;
	vector<vector<int>> g(N * M);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			g[i * M + j].push_back(i * M + (j + 1) % M);
			g[i * M + j].push_back((i + 1) % N * M + j);
			g[i * M + j].push_back(i * M + (j - 1 + M) % M);
			g[i * M + j].push_back((i - 1 + N) % N * M + j);
		}
	}
	while (K--) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].push_back(b);
		g[b].push_back(a);
		auto solve = [&](int i) {
			vector<int> v(N * M, -1);
			deque<int> q;
			q.push_back(i);
			v[i] = 0;
			int f;
			while (!q.empty()) {
				int j = f = q.front();
				q.pop_front();
				for (int k : g[j]) {
					if (v[k] == -1) {
						v[k] = v[j] + 1;
						q.push_back(k);
					}
				}
			}
			return v[f];
		};
		int ans = 0;
		for (int i = 0; i < N * M; i++) {
			ans = max(ans, solve(i));
		}
		cout << ans << '\n';
	}
	return 0;
}