import sys
input = sys.stdin.readline
sys.setrecursionlimit(222222)
n, m = map(int, input().split())

graph = []
for _ in range(n):
    graph.append(list(map(int, input().split())))

#1   .

dy = [-1, 0, 0, 1]
dx = [0, -1, 1, 0]
visited = [[False for _ in range(m+1)] for _ in range(n+1)]

group = [0 for _ in range(1000001)]
def dfs(y, x, num):

    graph[y][x] = num
    ret = 1
    for i in range(4):
        ny, nx = y + dy[i], x + dx[i]
        if not(0