iland.py

from queue import Queue

def solve():
    width, height = map(int, input().split())
    world = [[*map(int, input().split()), 0] for _ in range(height)] + [[0] * width]
    iland = 0
    q = Queue()
    for y in range(height):
        for x in range(width):
            if world[y][x]:
                iland += 1
                q.put((y, x))
                while not q.empty():
                    y, x = q.get()
                    world[y][x] = 0
                    if world[y-1][x]: q.put((y-1, x))
                    if world[y+1][x]: q.put((y+1, x))
                    if world[y][x-1]: q.put((y, x-1))
                    if world[y][x+1]: q.put((y, x+1))
    print(iland)


if __name__ == "__main__":
    solve()