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

int calcDist(vector<vector<int>>& adj, int start) {
    vector<int> dist(adj.size(), 1e9);
    dist[start] = 0;
    queue<int> q;
    q.push(start);
    int ans = -1;
    while (!q.empty()) {
        int node = q.front();
        q.pop();

        for (int next : adj[node]) {
            if (dist[next] == 1e9) {
                dist[next] = dist[node] + 1;
                ans = max(ans, dist[next]);
                q.push(next);
            }
        }
    }

    return ans;
}

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

    int n, m, k;
    cin >> n >> m >> k;

    int last = n * m;

    vector<vector<int>> adj(last);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int idx = i * m + j;
            if (j < m - 1) {
                adj[idx].push_back(idx + 1);
                adj[idx + 1].push_back(idx);
            }
            if (i < n - 1) {
                adj[idx].push_back(idx + m);
                adj[idx + m].push_back(idx);
            }
        }
    }

    for (int i=0; i < k; i++) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);

        int ans = 0;
        for (int i=0; i < last; i++) {
            ans = max(ans, calcDist(adj, i));
        }
        cout << ans << '\n';
    }

    return 0;
}