#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9 + 7;

int n, m, k, t;

int fel(int akt){
    return (akt - m + t) % t;
}

int le(int akt){
    return (akt + m) % t;
}

int balra(int akt){
    int sor = akt / m;
    if(akt + 1 <= (sor+1)*m - 1){
        return akt + 1;
    } else{
        return sor*m;
    }
}

int jobbra(int akt){
    int sor = akt / m;
    if(sor*m <= akt - 1){
        return akt - 1;
    } else{
        return (sor+1)*m - 1;
    }
}

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

    cin >> n >> m >> k;

    t = n*m;

    vector<vector<int>> tav(t, vector<int>(t, INF));

    for(int i = 0; i < t; i++){
        tav[i][fel(i)] = 1;
        tav[i][le(i)] = 1;
        tav[i][balra(i)] = 1;
        tav[i][jobbra(i)] = 1;
        tav[i][i] = 0;
    }


    while(k--){
        int a, b;
        cin >> a >> b;
        a--; b--;

        tav[a][b] = min(tav[a][b], 1);
        tav[b][a] = min(tav[b][a], 1);

        int ans = 0;

        for(int k = 0; k < t; k++){
            for(int i = 0; i < t; i++){
                for(int j = 0; j < t; j++){
                    tav[i][j] = min(tav[i][j], tav[i][k] + tav[k][j]);
                }
            }
        }

        for(int i = 0; i < t; i++){
            for(int j = 0; j < t; j++){
                ans = max(ans, tav[i][j]);
            }
        }


        cout << ans << "\n";
    }
}