// racshalosgraf.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <deque>
#include <vector>
#include <queue>
using namespace std;
struct adat
{
bool lat;
int tav;
vector<int>sz;
};
int n, m, i, j, db, mini, l, a, b,ujsz,kezd,akt,e;
vector<adat>x;
vector<int>megold;
queue<int>q;
int main()
{
cin >> n >> m>>ujsz;
x.resize(n * m+1);
for (i = 1; i <= n; ++i)
{
for(j = 1; j <= m; ++j)
{
db++;
if (i > 1) x[db].sz.push_back(db - m);
if (j > 1) x[db].sz.push_back(db - 1);
if (j < m) x[db].sz.push_back(db + 1);
if (i < n) x[db].sz.push_back(db + m);
}
}
for (l = 1; l <= ujsz; ++l)
{
cin >> a >> b;
x[a].sz.push_back(b);
x[b].sz.push_back(a);
mini = 0;
for (i = 1; i <= n * m; ++i)
{
kezd = i;
q.push(kezd);
x[kezd].lat = true;
x[kezd].tav = 0;
while (!q.empty())
{
akt = q.front();
q.pop();
for (auto& e : x[akt].sz)
{
if (!x[e].lat)
{
x[e].lat = true;
x[e].tav = x[akt].tav + 1;
if (x[e].tav > mini)
{
mini = x[e].tav;
}
q.push(e);
}
}
}
for (j = 1; j <= n * m; ++j)
{
x[j].lat = false;
x[j].tav = 0;
}
}
megold.push_back(mini);
}
for (i = 0; i<megold.size(); ++i)
{
cout << megold[i] << "\n";
}
return 0;
}
/*
3 4 4
1 6
7 10
2 12
4 9
*/
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started:
// 1. Use the Solution Explorer window to add/manage files
// 2. Use the Team Explorer window to connect to source control
// 3. Use the Output window to see build output and other messages
// 4. Use the Error List window to view errors
// 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
// 6. In the future, to open this project again, go to File > Open > Project and select the .sln file