import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;

public class Main {

  static boolean[][] visited;
  static int[][] map;
  static int worms = 0;

  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int count = Integer.parseInt(br.readLine());

    for (int i = 0; i < count; i++) {
      int[] colRowCabbage = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt)
          .toArray();
      visited = new boolean[colRowCabbage[0]][colRowCabbage[1]];
      map = new int[colRowCabbage[0]][colRowCabbage[1]];
      worms = 0;

      for (int j = 0; j < colRowCabbage[2]; j++) {
        int[] cabbage = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt)
            .toArray();
        map[cabbage[0]][cabbage[1]] = 1;
      }

      for (int j = 0; j < map.length; j++) {
        for (int k = 0; k < map[0].length; k++) {
          if (!visited[j][k] && map[j][k] == 1) {
            bfs(j, k);
          }
        }
      }
      System.out.println(worms);
    }
  }

  public static void bfs(int row, int col) {
    Queue<int[]> queue = new LinkedList<>();
    visited[row][col] = true;
    queue.add(new int[]{row, col});
    worms += 1;

    while (!queue.isEmpty()) {
      int[] xy = queue.poll();
      int x = xy[0];
      int y = xy[1];

      int[] dx = {0, 0, 1, -1};
      int[] dy = {1, -1, 0, 0};

      for (int k = 0; k < 4; k++) {
        int nx = x + dx[k];
        int ny = y + dy[k];
        if (nx >= 0 && nx < map.length && ny >= 0 && ny < map[0].length) {
          if (!visited[nx][ny] && map[nx][ny] == 1) {
            queue.add(new int[]{nx, ny});
            visited[nx][ny] = true;
          }
        }
      }
    }
  }

}