#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <array>

using namespace std;

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

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

	vector<vector<int>> g(n*m);
	for (i = 0; i < n*m; i++)
	{
		if (i / m == (i - 1) / m && i > 0) g[i].push_back(i - 1);
		if (i / m == (i + 1) / m) g[i].push_back(i + 1);
		if (i - m > 0) g[i].push_back(i - m);
		if (i + m < n*m) g[i].push_back(i + m);
	}

	vector<int> state(n * m, 0);
	int token = 1;

	while (k--)
	{
		int node1, node2;
		cin >> node1 >> node2;
		g[--node1].push_back(--node2);
		g[node2].push_back(node1);

		int maxl = 0;
		for (i = 0; i < n*m; i++)
		{
			queue<array<int, 2>> q;
			q.push({ i, 0 });
			while (true)
			{
				for (int neighbour : g[q.front()[0]])
				{
					if (state[neighbour] != token)
					{
						state[neighbour] = token;
						q.push({ neighbour, q.front()[1] + 1 });
					}
				}
				if (q.size() == 1) break;
				q.pop();
			}
			maxl = max(maxl, q.front()[1]);
			token++;
		}
		cout << maxl << '\n';
	}
}