Go: package main

import (
	"fmt"
)

func main() {
	var h, w int
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			return
		}
		matrix := make([][]int, h)
		Sean := make([][]bool, h)
		for i := 0; i < h; i++ {
			matrix[i] = make([]int, w)
			Sean[i] = make([]bool, w)
			for j := 0; j < w; j++ {
				fmt.Scan(&matrix[i][j])
			}
		}
		var count int
		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				if matrix[i][j] == 1 && Sean[i][j] == false {
					search(i, j, h, w, matrix, Sean)
					count++
				}
			}
		}
		fmt.Println(count)
	}
}
func search(x int, y int, h int, w int, matrix [][]int, Sean [][]bool) {
	if x < 0 || y < 0 || x >= h || y >= w || matrix[x][y] == 0 {
		return
	}
	if Sean[x][y] == true {
		return
	}

	Sean[x][y] = true

	search(x+1, y, h, w, matrix, Sean)
	search(x-1, y, h, w, matrix, Sean)
	search(x, y+1, h, w, matrix, Sean)
	search(x, y-1, h, w, matrix, Sean)
	search(x+1, y-1, h, w, matrix, Sean)
	search(x-1, y+1, h, w, matrix, Sean)
	search(x+1, y+1, h, w, matrix, Sean)
	search(x-1, y-1, h, w, matrix, Sean)
}

Python: import sys
from collections import deque

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    ans = []
    while True:
        W, H = map(int, input().split())
        if W == H == 0:
            break
        grid = [list(map(int, input().split())) for _ in range(H)]

        res = 0
        visited = [[False] * W for _ in range(H)]
        for y in range(H):
            for x in range(W):
                if grid[y][x] == 1 and not visited[y][x]:
                    res += 1
                    que = deque([[y, x]])
                    while que:
                        h, w = que.pop()
                        for dh, dw in ((1, 0), (-1, 0), (0, 1), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)):
                            next_h, next_w = h + dh, w + dw
                            if next_h < 0 or next_h >= H or next_w < 0 or next_w >= W or grid[next_h][next_w] == 0:
                                continue
                            else:
                                if not visited[next_h][next_w]:
                                    visited[next_h][next_w] = True
                                    que.append([next_h, next_w])
        ans.append(res)
    print(*ans, sep="\n")


if __name__ == '__main__':
    resolve()

Python: w, h = map(int,input().split())
c = [list(map(int,input().split())) for j in range(h)]
count = 0

def dfs(x,y):
    c[x][y] = 0
    for dx in [-1,0,1]:
        for dy in [-1,0,1]:
            nx = x + dx
            ny = y + dy
            if(0 <= nx < w and 0 <= ny <= h and c[nx][ny] == 1 ):
                dfs(nx, ny)
    
for i in range(h):
    for j in range(w):
        if (c[i][j] == 1):
            dfs(i,j)
            count += 1

print(count)

Python: from collections import deque
while True:
    w, h = map(int, input().split())
    if w == 0 and h == 0:
        break
    areas = [list(map(int, input().split())) for _ in range(h)]

    # print(areas)

    # 島の数を出す。
    # 島の定義は陸地続きであること。ただし、斜めもみて、陸だったらそれは島
    # 左上からスタートして、陸続きのものは飛ばす

    move_positions = [[-1, -1], [-1, 0], [-1, 1],
                      [0, -1], [0, 1], [1, -1], [1, 0], [1, 1]]
    count = 0
    queue = deque([])
    for i in range(h):
        for j in range(w):
            start_position = [i, j]
            queue.append(start_position)
            has_island = False
            while queue:
                now_position = queue.popleft()
                if areas[now_position[0]][now_position[1]] == 0:
                    continue
                has_island = True
                areas[now_position[0]][now_position[1]] = 0
                for move_position in move_positions:
                    next_position = [now_position[0] + move_position[0],
                                     now_position[1] + move_position[1]]
                    if 0 <= next_position[0] and next_position[0] < h and 0 <= next_position[1] and next_position[1] < w:
                        queue.append(next_position)
            if has_island:
                count += 1
    print(count)

Python: # -*- coding: utf-8 -*-
"""
How Many Islands?
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1160&lang=jp

"""
import sys
from sys import stdin
from collections import deque
input = stdin.readline


def bfs(data, sx, sy, w, h):
    dy = [-1, 1, 0, 0, -1, -1, 1, 1]
    dx = [0, 0, -1, 1, -1, 1, -1, 1]
    Q = deque()
    Q.append((sx, sy))
    data[sy][sx] = '-'
    while Q:
        cx, cy = Q.popleft()        #  現在地の座標
        for i in range(8):
            nx = cx + dx[i]
            ny = cy + dy[i]
            if (not 0 <= nx < w) or (not 0 <= ny < h):
                continue
            elif data[ny][nx] == '1':
                Q.append((nx, ny))
                data[ny][nx] = '-'


def solve(field, w, h):
    ans = 0
    for y in range(h):
        for x in range(w):
            if field[y][x] == '1':
                bfs(field, x, y, w , h)
                ans += 1
    return ans


def main(args):
    while True:
        w, h = map(int, input().split())
        if w == 0 and h == 0:
            break
        field = []
        for _ in range(h):
            field.append([x for x in input().split()])
        ans = solve(field, w, h)
        print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

def dfs(s,Map,H,W,c):
    dxdy = [(1,0),(-1,0),(0,1),(0,-1),(1,1),(-1,-1),(-1,1),(1,-1)]
    for i in range(len(dxdy)):
        Map[s[0]][s[1]] = c
        nextPos = (s[0]+dxdy[i][0],s[1]+dxdy[i][1])
        if nextPos[0] >= 0 and nextPos[1] >= 0 and nextPos[0] < H and nextPos[1] < W:
            if Map[nextPos[0]][nextPos[1]] == 1:
                dfs(nextPos,Map,H,W,c)

while True:
    W,H = map(int,input().split(" "))
    if W == 0 and H == 0:
        break
    Map = [list(map(int,input().split())) for i in range(0,H)]
    c = 1
    for i in range(H):
        for j in range(W):
            if Map[i][j] == 1:
                c += 1
                dfs((i,j),Map,H,W,c)
    print(c-1)

Python: import queue
def main():
	count_list = []

	w,h = map(int,input().split())
	while not(w == 0 and h == 0):
		data = []
		count = 0
		for _ in range(h):
			data.append(list(map(int,input().split())))

		for row,i in zip(data,range(len(data))):
			for cell,j in zip(row,range(len(row))):
				if cell == 1:
					fill_sea(data,j,i,w,h)
					count += 1

		w,h = map(int,input().split())
		count_list.append(count)




	for i in count_list:
		print(i)


def fill_sea(data,x,y,w,h):
	q = queue.LifoQueue()
	q.put((x,y))
	while not q.empty():
		current_cell = q.get()
		data[current_cell[1]][current_cell[0]] = 0


		for i in [-1,0,1]:
			if current_cell[1]+i <= -1 or  current_cell[1]+i >= h:
				continue
			for j in [-1,0,1]:
				if i == 0 and j == 0:
					continue
				if current_cell[0]+j <= -1 or current_cell[0]+j >= w :
					continue

				if data[current_cell[1]+i][current_cell[0]+j] == 1:
					q.put((current_cell[0]+j,current_cell[1]+i))


if __name__ == '__main__':
	main()

Python: #!python
# -*- coding: utf-8 -*-

import sys

import numpy as np

sys.setswitchinterval(10**8)


next_s = ((-1, 1), (0, 1), (1, 1),
          (-1, 0), (1, 0),
          (-1, -1), (0, -1), (1, -1))


def DFS(x, y):
    if not (0 <= x < W and 0 <= y < H):
        return
    if not map_[y * W + x]:
        return

    map_[y * W + x] = 0

    for dx, dy in next_s:
        DFS(x + dx, y + dy)


while True:
    W, H = map(int, input().split())
    if W == 0 and H == 0:
        break

    map_ = []
    for h in range(H):
        map_ += list(map(int, input().split()))
    # print(map_)
    island_num = 0
    while any(map_):
        next_idx = map_.index(1)
        x = next_idx % W
        y = next_idx // W
        # print(map_)
        # print("x: {} | y: {}".format(x, y))
        DFS(x, y)
        island_num += 1

    print(island_num)