import sys
sys.setrecursionlimit(3000)
def dfs(x, y):
if x < 0 or x >= n or y < 0 or y >= m:
return False
if graph[x][y] == 1:
graph[x][y] = 0
dfs(x - 1, y)
dfs(x + 1, y)
dfs(x, y - 1)
dfs(x, y + 1)
return True
return False
t = int(input())
for i in range(t):
m, n, k = map(int, input().split())
graph = [[0] * m for _ in range(n)]
count = 0
for j in range(k):
x, y = map(int, input().split())
graph[y][x] = 1
for j in range(n):
for p in range(m):
if dfs(j, p) == True:
count += 1
print(count)
