#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

vector<vector<ll>> v;
ll s;

const ll inf = 1e9;

vector<pair<ll,ll>> dir = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};

bool ins(ll i, ll j, ll n, ll m) {

	if(i < 0 || i >= n || j < 1 || j > m) {
		return false;
	}
	return true;

}

ll fw() {

	ll mx = 0;

	for(ll k = 1; k <= s; k++) {
		for(ll i = 1; i <= s; i++) {
			for(ll j = 1; j <= s; j++) { 
				if(v[i][k] < inf && v[k][j] < inf) {
					
					v[i][j] = min(v[i][j], v[i][k] +  v[k][j]);
				}
			}
		}
	}

	for(ll i = 1; i <= s; i++) {
		for(ll j = i + 1; j <= s; j++) {

			mx = max(mx, v[i][j]);

		}
	}



	return mx;

}


void solve() {

	ll n, m;
	cin >> n >> m;
	ll k;
	cin >> k;

	s = n * m;

	v.resize(s+1, vector<ll>(s+1, inf));

	// floyd-warhsall is v^3 -> 200 ^ 3 still fits
	// and k is <= 100
	// so 10 ^ 2 * 10^6 * 2 = 2 * 10^8
	// . . . it *should* fit
	// maybe

	for(ll i = 0; i < n; i++) {

		for(ll j = 1; j <= m; j++) {

			//cerr << "\ncurr=" << i * m + j;

			v[i * m + j][i * m + j] = 0;

			vector<pair<ll,ll>> dir = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};

			for(const auto & [di, dj] : dir) {

				ll hi = i + di;
				ll hj = j + dj;

				if(ins(hi, hj, n, m)) {
					
					ll neigh = hi * m + hj;
					//cerr << "\nneighbor " << neigh << " exists";

					v[i * m + j][hi * m + hj] = 1;

				}

			}

		}

	}

	for(ll i = 0; i < k; i++) {
		ll a, b;
		cin >> a >> b;

		v[a][b] = 1;
		v[b][a] = 1;

		cout << fw() << "\n";
	}


}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}