#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define fi first
#define se second

vector<vector<int> > d;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    d.resize(n*m+1, vector<int>(n*m+1));
    for (int i=0; i<n*m; i++){
        for (int j=i; j<n*m; j++){
            d[i+1][j+1] = abs(i % m - j % m) + abs(i / m - j / m);
            d[j+1][i+1] = abs(i % m - j % m) + abs(i / m - j / m);
        }
    }
    while (k--){
        int a, b, op = 0;
        cin >> a >> b;
        for (int i=1; i<=n*m; i++){
            for (int j=i; j<=n*m; j++){
                d[i][j] = min(d[i][j], min(d[i][a] + d[j][b] + 1, d[i][b] + d[j][a] + 1));
                d[j][i] = d[i][j];
                op = max(op, d[i][j]);
            }
        }
        cout << op << "\n";
    }
}