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

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

signed main() {
    int n,m,K;cin>>n>>m>>K;
    vector<vector<int>> v(n*m+2,vector<int>(n*m+2,1e12));
    for(int i = 1;i<=n*m;i++){
        v[i][i]=0;
        if(i%m!=1)v[i][i-1]=1;
        else v[i][i-1+m]=1;
        if(i%m!=0)v[i][i+1]=1;
        else v[i][i+1-m]=1;
        if(i>m)v[i][i-m]=1;
        else v[i][i+(n-1)*m]=1;
        if(i<=(n-1)*m)v[i][i+m]=1;
        else v[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++){
                v[i][j]=min(v[i][j],v[i][k]+v[k][j]);
            }
        }
    }
    while(K--){
        int ans=0;
        int a,b;cin>>a>>b;
        v[a][b]=1;
        v[b][a]=1;
        for(int k = 1;k<=n*m;k++){
            v[a][k]=min(v[b][k]+1,v[a][k]);
            v[k][a]=v[a][k];
            v[k][b]=min(v[k][b],v[k][a]+1);
            v[b][k]=v[k][b];
        }
        for(int i = 1;i<=n*m;i++){
            for(int j = i+1;j<=n*m;j++){
                ans=max(ans,v[i][j]);
            }
        }
        cout<<ans<<endl;
    }
}