#include <bits/stdc++.h>
using namespace std;
vector<int> g[201]; 
int bfs(int x){
	vector<bool> seen;
	seen.resize(201, 0);
	int tav[201];
	int mx=0;
	tav[x]=0;
	queue<int> q;
	q.push(x);
	while (!q.empty()){
		int v=q.front();
		q.pop();
		seen[v]=true;
		for (int x:g[v]){
			if (!seen[x]){
				tav[x]=tav[v]+1; 
				seen[x]=true;
				mx=max(mx,tav[x]);
				q.push(x);
			}
		}


	}
	return (mx); 
}
int main() {
	int n, m, k;
	cin>>n>>m>>k;
	for (int i=1;i<=n*m;i++){
		if ((i%m==0 or i%m-1>0)  && i%m!=1){
			 g[i].push_back(i-1);
		}
		if (i%m+1<=m && i%m!=0){
			g[i].push_back(i+1);
		}
		if (i-m>0){
		 g[i].push_back(i-m);
		} 
		if (i+m<=n*m){
			g[i].push_back(i+m);
		
		}
		

		

	}
	for (int i=0; i<k;i++){
		int x,y;
		cin>>x>>y; 
		g[x].push_back(y);
		g[y].push_back(x);
		int ans=0; 
		for (int i=1; i<=n*m;i++){
			ans=max(ans, bfs(i));
		}
		cout<<ans<<endl; 
	}

}