#include <iostream>
#include <queue>
#include <algorithm>
#include <climits>
#define ll long long

using namespace std;

struct adat
{
    ll hossz = INT_MAX;
    vector < pair <ll, ll> > sz;
};
vector <adat> x;

struct tav
{
    ll hova, kolt;
};
priority_queue <tav> t;

bool operator < (const tav& a, const tav& b)
{
    return a.kolt > b.kolt;
}

vector <ll> maxi;

ll n, m;
void dijkstra(ll kezd)
{
    tav akt;
    t.push({ kezd, 0 });
    x[kezd].hossz = 0;
    while (!t.empty())
    {
        akt = t.top();
        t.pop();
        for (auto& e : x[akt.hova].sz)
        {
            if (x[e.first].hossz > (e.second + akt.kolt))
            {
                x[e.first].hossz = e.second + akt.kolt;
                t.push({ e.first, x[e.first].hossz });
            }
        }
    }
    ll maximum = INT_MIN;
    for (ll i = 1; i <= n * m; ++i)
        if (x[i].hossz > maximum)
            maximum = x[i].hossz;

    maxi.push_back(maximum);
}

int main()
{
    ll k;
    cin >> n >> m >> k;
    x.resize(n * m + 1);
    for (ll i = 1; i <= n * m; ++i)
    {
        if (i > m)
        {
            x[i].sz.push_back({ i - m, 1 });
            x[i - m].sz.push_back({ i, 1 });
        }
        if (i % m == 0)
            continue;
        x[i].sz.push_back({ i + 1, 1 });
        x[i + 1].sz.push_back({ i, 1 });
    }
    for (ll i = 1; i <= k; ++i)
    {
        ll a, b;
        cin >> a >> b;
        x[a].sz.push_back({ b, 1 });
        x[b].sz.push_back({ a, 1 });
        for (ll j = 1; j <= n * m; ++j)
        {
            dijkstra(j);
            for (ll g = 1; g <= n * m; ++g)
            {
                x[g].hossz = INT_MAX;
            }
        }
        ll nagy = INT_MIN;
        for (auto& e : maxi)
            if (nagy < e)
                nagy = e;
        maxi.clear();
        
        cout << nagy << endl;
    }

    return 0;
}
/*
3 4 4
1 6
7 10
2 12
4 9
*/