#include <iostream>
#include <vector>
#include <deque>
#define ll long long 

using namespace std;

struct adat
{
    ll f, s, steps;
};
struct element
{
    bool lat;
    vector <ll> sz;
};
ll n, m, i, j, a, b,k,M;

int main()
{
    cin >> n >> m>> M;
    vector <element> x((n*m) + 1);
    for (i = 1; i <= n * m; ++i)
    {
        if (i > m) x[i].sz.push_back(i - m);
        if (i <= (n * m) - m) x[i].sz.push_back(i + m);
        if (i % m != 0) x[i].sz.push_back(i + 1);
        if (i % m != 1) x[i].sz.push_back(i - 1);
    }
    ll maxi = (n - 1) * (m - 1);

    for (k = 1; k <= M; ++k)
    {
        cin >> a >> b;
        x[a].sz.push_back(b);
        x[b].sz.push_back(a);
        maxi = -1;
        for (i = 1; i <= n * m; ++i)
        {
            for (j = 1; j <= n * m; ++j) x[j].lat = false;
            deque <pair<ll, ll> > v;
            v.push_back({ i,0 });
            pair<ll, ll> act;
            x[i].lat = true;
            while (!v.empty())
            {
                act = v[0];
                v.pop_front();
                for (auto e : x[act.first].sz)
                {
                    if (!x[e].lat)
                    {
                        x[e].lat = true;
                        if (act.second + 1 > maxi) maxi = act.second + 1;
                        v.push_back({ e,act.second + 1 });
                    }
                }
            }

        }
        cout<<maxi<<"\n";

    }
}