#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int n, m;
void check(vector<vector<bool> >& board, int& ans, int cnt){
	ans = min(ans, cnt);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(board[i][j]){
				if(i > 0 && i < n - 1){
					//向下跳
					if(board[i-1][j] && !board[i+1][j]){
						board[i-1][j] = board[i][j] = false;
						board[i+1][j] = true;
						check(board, ans, cnt - 1);
						board[i-1][j] = board[i][j] = true;
						board[i+1][j] = false;
					}
					//向上跳
					if(!board[i-1][j] && board[i+1][j]){
						board[i+1][j] = board[i][j] = false;
						board[i-1][j] = true;
						check(board, ans, cnt - 1);
						board[i+1][j] = board[i][j] = true;
						board[i-1][j] = false;
					}
				}
				
				if(j > 0 && j < m - 1){
					//向右跳
					if(board[i][j-1] && !board[i][j+1]){
						board[i][j-1] = board[i][j] = false;
						board[i][j+1] = true;
						check(board, ans, cnt - 1);
						board[i][j-1] = board[i][j] = true;
						board[i][j+1] = false;
					}
					//向左跳
					if(!board[i][j-1] && board[i][j+1]){
						board[i][j+1] = board[i][j] = false;
						board[i][j-1] = true;
						check(board, ans, cnt - 1);
						board[i][j+1] = board[i][j] = true;
						board[i][j-1] = false;
					}
				}
			}
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int T, k;
	cin >> T;
	while(T--){
		cin >> n >> m >> k;
		int ans = k;
		vector<vector<bool> > board(n, vector<bool>(m, false));
		int a, b;
		for(int i = 0; i < k; i++){
			cin >> a >> b;
			board[a-1][b-1] = true;
		}
		check(board, ans, k);
		cout << ans << endl;
	}
	return 0;
}