// Source: https://usaco.guide/general/io

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

int INF = 1e9;

int main() {
	int n, m, kk; cin >> n >> m >> kk;
	vector<vector<int>> d(n*m+1, vector<int>(n*m+1, INF));

	for (int i = 1; i <= n*m; i++){
		d[i][i] = 0;
		if (i % m == 1){ // bal szél
			if (i < m+1){ // teteje
				d[i][i+m] = 1;
				d[i][i + (n-1)*m] = 1;
			}
			else if (i > (n-1)*m){ // alja
				d[i][i-m] = 1;
				d[i][1] = 1;
			} 
			else {
				d[i][i-m] = 1;
				d[i][i+m] = 1;
			}
			d[i][i+1] = 1;
			d[i][i+m-1] = 1;
		}
		else if (i % m == 0){ // jobb szél
			if (i < m+1){ // teteje
				d[i][i+m] = 1;
				d[i][i + (n-1)*m] = 1;
			}
			else if (i > (n-1)*m){ // alja
				d[i][i-m] = 1;
				d[i][m] = 1;
			} 
			else {
				d[i][i-m] = 1;
				d[i][i+m] = 1;
			}
			d[i][i-1] = 1;
			d[i][i-m+1] = 1;
		}
		else if (i < m+1){ // teteje
				d[i][i+1] = 1;
				d[i][i-1] = 1;
				d[i][i+m] = 1;
				d[i][i + (n-1)*m] = 1;
		}
		else if (i > (n-1)*m){ // alja
				d[i][i+1] = 1;
				d[i][i-1] = 1;
				d[i][i-m] = 1;
				d[i][i - (n-1)*m] = 1;
		}
	}

	for (int k = 1; k <= n*m; k++){
		for (int i = 1; i <= n*m; i++){
			for (int j = 1; j <= n*m; j++){
				if (d[i][k] != INF && d[k][j] != INF){
					d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
				}
			}
		}
	}

	for (int _ = 0; _ < kk; _++){
		int ki, kj; cin >> ki >> kj;
		for (int i = 1; i <= n*m; i++){
			for (int j = 1; j <= n*m; j++){
				if (d[i][ki] != INF && d[kj][j] != INF){
					d[i][j] = min(d[i][j], d[i][ki] + d[kj][j] + 1);
					d[i][j] = min(d[i][j], d[i][kj] + d[ki][j] + 1);
				}
			}
		}
		int ans = 0;
		for (int i = 1; i <= n*m; i++){
			for (int j = 1; j <= n*m; j++){
				if (d[i][j] != INF){
					ans = max(ans, d[i][j]);
				}
			}
		}
		cout << ans << endl;
	}


}