#include <bits/stdc++.h>
using namespace std;
using ll=long long; 
vector<ll> g[201];

ll bfs(ll x){
	vector<bool>seen; 
	seen.resize(201,false);
	ll tav[201];
	queue<ll> q;
	q.push(x);
	seen[x]=true;
	tav[x]=0;
	ll ans=0; 
	while (!q.empty()){
		ll v=q.front();

		q.pop();
		for (auto edge:g[v]){
			if (!seen[edge]){
				tav[edge]=tav[v]+1;
				ans=max(ans, tav[edge]);
				q.push(edge);
				seen[edge]=true; 
			}
		}
	}
	return ans; 


}
int main() {
	ll n, m;
	cin>>n>>m;
	swap(n,m);
	for (ll i=1; i<=m;i++){
		g[1+(i-1)*n].push_back(i*n);
		g[i*n].push_back(1+(i-1)*n);
	}
	for (ll i=1; i<=n*m;i++){
			if ((i)%n!=1){
				g[i].push_back(i-1);
			}
			if ((i)%n!=0) g[i].push_back(i+1);
			if (i<(m-1)*n+1){
				g[i].push_back(i+n);
				g[i+n].push_back(i);
			}
			if (i<=n){
				g[i].push_back(i+(m-1)*n); 
				g[i+(m-1)*n].push_back(i); 
		}
	}
	ll k;
	cin>>k;
	for (ll u=0; u<k;u++){
		ll a, b;
		cin>>a>>b;
		g[a].push_back(b);
		g[b].push_back(a);
		ll ans=0;
		for (ll i=1; i<=n*m;i++) ans=max(ans, bfs(i));
		cout<<ans<<endl;  
	}
}