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

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

vector<vector<int>> v;

int main() {
    int n,m,k;cin>>n>>m>>k;
    v.resize(n*m+2);
    for(int i = 1;i<=n*m;i++){
        if((i-1)%m>0)v[i].push_back(i-1);
        if((i-1)%m<m-1)v[i].push_back(i+1);
        if((i-1)/m>0)v[i].push_back(i-m);
        if((i-1)/m<n-1)v[i].push_back(i+m);
    }
    vector<vector<int>> tav(n*m+2,vector<int>(n*m+2,INT_MAX));
    for(int i = 1;i<=n*m;i++){
        for(int j = 1;j<=n*m;j++){
            tav[i][j]=abs((i-1)%m-(j-1)%m)+abs((i-1)/m-(j-1)/m);
            //cout<<tav[i][j]<<' ';
        }//cout<<endl;
    }
    for(int xyz=0;xyz<k;xyz++){
        int U,V;cin>>U>>V;
        tav[U][V]=tav[V][U]=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++){
                    tav[i][j]=min(tav[i][j],tav[i][K]+tav[K][j]);
                }
            }
        }
        int mx=0;
        for(int i = 1;i<=n*m;i++){
            for(int j = 1;j<=n*m;j++){
                //cout<<tav[i][j]<<' ';
                mx=max(mx,tav[i][j]);
            }//cout<<endl;
        }
        cout<<mx<<endl;
    }
}