[BOJ] 1012. 유기농 배추

import java.util.Scanner;

public class Main {
	static int M,N;
	static int[][] map;
	static boolean[][] check;
	static int[] dy = {1,0,-1,0};
	static int[] dx = {0,1,0,-1};
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int t = 0; t < T; t++) {
			M = sc.nextInt();
			N = sc.nextInt();
			int K = sc.nextInt();
			map = new int[N][M];
			check = new boolean[N][M];
			
			for(int i = 0; i < K; i++) {
				int x = sc.nextInt();
				int y = sc.nextInt();
				map[y][x] = 1;
			}
			int ans = 0;
			for(int i = 0; i < N; i++) {
				for(int j = 0; j < M; j++) {
					if(map[i][j] == 1 && !check[i][j]) {
						ans++;
						dfs(i,j);
					}
				}
			}
			
			System.out.println(ans);
		}
	}
	
	static void dfs(int y, int x) {
		check[y][x] = true;
		for(int i = 0; i < dy.length; i++) {
			int ny = y + dy[i];
			int nx = x + dx[i];
			if(ny < 0 || ny >= N || nx < 0 || nx >= M) continue;
			if(!check[ny][nx] && map[ny][nx] == 1) {
				dfs(ny,nx);
			}
		}
	}
}