#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<int>> neighbourS(N * M);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            if (i - 1 >= 0) {
                neighbourS[i * M + j].push_back((i - 1) * M + j);
            }
            if (i + 1 < N) {
                neighbourS[i * M + j].push_back((i + 1) * M + j);
            }
            if (j - 1 >= 0) {
                neighbourS[i * M + j].push_back(i * M + j - 1);
            }
            if (j + 1 < M) {
                neighbourS[i * M + j].push_back(i * M + j + 1);
            }
        }
    }
    while (K--) {
        int A, B;
        cin >> A >> B;
        neighbourS[A - 1].push_back(B - 1);
        neighbourS[B - 1].push_back(A - 1);
        int maximum = 0;
        for (int i = 0; i < N * M; i++) {
            queue<int> currentS;
            currentS.push(i);
            vector<int> distanceS(N * M, -1);
            distanceS[i] = 0;
            while (!currentS.empty()) {
                int c = currentS.front();
                currentS.pop();
                maximum = max(maximum, distanceS[c]);
                for (auto e : neighbourS[c]) {
                    if (distanceS[e] == -1) {
                        distanceS[e] = distanceS[c] + 1;
                        currentS.push(e);
                    }
                }
            }
        }
        cout << maximum << '\n';
    }
}