#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
using i64 = long long;
 
typedef pair<int, int> PII;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<int, PII> PIII;
typedef pair<int, pair<int, bool>> PIIB;
 
const int N = 10;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const int mod1 = 954169327;
const int mod2 = 906097321;
const int INF = 0x3f3f3f3f3f3f3f3f;
 
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
 
void solve()
{
	int n, m, k;
	cin >> n >> m >> k;
	vector<vector<int>> g(n + 1, vector<int>(m + 1));
	vector<vector<int>> st(n + 1, vector<int>(m + 1, -1));
	for (int i = 0; i < k; i ++ )
	{
		int x, y;
		cin >> x >> y;
		g[x][y] = 1;
	}
	int res = 0;
	int ans = 0;
	function<void(int, int)> dfs = [&](int x, int y)
	{
		for (int i = 0; i < 4; i ++ )
		{
			int nx = x + dx[i], ny = y + dy[i];
			int nnx = nx + dx[i], nny = ny + dy[i];
			if (nx <= 0 || ny <= 0 || nx > n || ny > m) continue;
			if (nnx <= 0 || nny <= 0 || nnx > n || nny > m) continue;
			if (g[nx][ny] == 1 && g[nnx][nny] == 0)
			{
				g[x][y] = 0;
				g[nx][ny] = 0;
				g[nnx][nny] = 1;
				res ++ ;
				ans = max(ans, res);
				for (int ii = 1; ii <= n; ii ++ )
				{
					for (int jj = 1; jj <= m; jj ++ )
					{
						if (g[ii][jj] == 1) dfs(ii, jj);
					}
				}
				g[x][y] = 1;
				g[nx][ny] = 1;
				g[nnx][nny] = 0;
				res -- ;
			}
		}
	};
	for (int i = 1; i <= n; i ++ )
		for (int j = 1; j <= m; j ++ )
			if (g[i][j] == 1) dfs(i, j);
	cout << k - ans << '\n';
}
 
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
 
	int t = 1;
	cin >> t;
	while (t--)
	{
		solve();
	}
}