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

int main()
{
    int n, m, k; cin >> n >> m >> k;
    vector<vector<int>>dist(n*m+1, vector<int>(n*m+1, 1e9)), adj(n*m+1);
    for(int i=1;i<=n*m;i++)
    {
        dist[i][i] = 0;
        if(i%m != 0)
        {
            adj[i].push_back(i+1);
            adj[i+1].push_back(i);
            dist[i][i+1] = 1;
            dist[i+1][i] = 1;
        }
        if(i <= (n-1)*m)
        {
            adj[i].push_back(i+m);
            adj[i+m].push_back(i);
            dist[i][i+m] = 1;
            dist[i+m][i] = 1;
        }
    }
    for(int i=1;i<=n*m;i++)
    for(int j=i+1;j<=n*m;j++)
    for(int k=1;k<=n*m;k++)
    {
        if(dist[i][k] + dist[k][j] < dist[i][j])
            {
                dist[i][j] = dist[j][i] = dist[i][k] + dist[k][j];
            }
    }
    while(k--)
    {
        int u, v;
        cin >> u >> v;
        dist[u][v] = 1;
        dist[v][u] = 1;
        for(int i=1;i<=n*m;i++)
        for(int j=i+1;j<=n*m;j++)
        {
            if(dist[i][u] + dist[v][j] +1 < dist[i][j])
            {
                dist[i][j] = dist[j][i] = dist[i][u] + dist[v][j] + 1;
            }
        }
        int ln=0;
        for(int i=1;i<=n*m;i++)
        for(int j=i+1;j<=n*m;j++)
        {
            ln = max(ln, dist[i][j]);
        }
        cout <<ln << endl;
    }
}