Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

Python: import sys
sys.setrecursionlimit(10**6)

ans = []
while True:
    w, h = map(int, input().split())
    if w == 0 and h == 0:
        break
    c = [list(map(int, input().split())) for _ in range(h)]
    s = [[0] * w for _ in range(h)]

    def dfs(x, y):
        s[y][x] = 1

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

    res = 0
    for i in range(h):
        for j in range(w):
            if c[i][j] == 1 and s[i][j] == 0:
                dfs(j, i)
                res += 1
    ans.append(res)

for a in ans:
    print(a)

Python: import sys
from itertools import product

sys.setrecursionlimit(10 ** 9)


def dfs(c, x, y):
    c[x][y] = 0
    for dx, dy in product((-1, 0, 1), repeat=2):
        if dx == dy == 0:
            continue
        if c[x + dx][y + dy] == 1:
            dfs(c, x + dx, y + dy)


def main():
    input = sys.stdin.buffer.readline
    while True:
        w, h = map(int, input().split())
        if w == h == 0:
            break
        c = [
            [0] + list(map(int, input().split())) + [0]
            if 1 <= i <= h
            else [0] * (w + 2)
            for i in range(h + 2)
        ]
        cnt = 0
        for i in range(h + 2):
            for j in range(w + 2):
                if c[i][j]:
                    cnt += 1
                    dfs(c, i, j)
        print(cnt)


if __name__ == "__main__":
    main()

Python: from collections import deque

result = []

while True:
    w, h = map(int, input().split())
    
    if w == 0 and h == 0:
        break
        
    L = [list(map(int, input().split())) for i in range(h)]
    flag = [[-1 for _ in range(w)] for _ in range(h)]
    res = 0
    q = deque()
    
    for y in range(h):
        for x in range(w):
            if L[y][x] == 1 and flag[y][x] == -1:
                q.append([y, x])
                flag[y][x] = 0
                res += 1
                while q:
                    ny, nx = q.pop()
                    for i, j in [(0,1), (0,-1), (1,0), (-1,0), (1,1), (1, -1), (-1, 1), (-1, -1)]:
                        if 0 <= ny + i < h and 0 <= nx + j < w:
                            if L[ny + i][nx + j] == 1 and flag[ny + i][nx + j] == -1:
                                q.append([ny + i, nx + j])
                                flag[ny + i][nx + j] = 0
                            
    result.append(res)
                            
        
for res in result:
    print(res)

Python: while 1:
    W, H = list(map(int,input().split()))
    if W == 0:break

    C = [list(map(int, input().split())) for i in range(H) ]
    
    def work(x,y):
        ax = [-1, 0, 1, -1, 1, -1, 0, 1]
        ay = [-1, -1, -1, 0, 0, 1, 1, 1]

        if C[y][x] != 1:return False
        stack = [(x,y)]

        while len(stack) > 0:
            s = stack.pop(-1)
            C[s[1]][s[0]] = -1 #mark

            for _x in [s[0] + _x for _x in ax]:
                for _y in [s[1] + _y for _y in ay]:
                    if 0 <= _x < W and 0 <= _y < H and C[_y][_x] == 1:
                        stack.append((_x, _y))
        return True
#    def work(x,y):
#        ax = [-1, 0, 1, -1, 1, -1, 0, 1]
#        ay = [-1, -1, -1, 0, 0, 1, 1, 1]
#
#        if C[y][x] != 1:return False
#        C[y][x] = -1 #mark
#
#        for _ax in ax:
#            for _ay in ay:
#                if 0 <= _ax + x < W and 0 <= _ay + y < H:
#                    work(_ax + x, _ay + y)
#        return True

    cnt = 0
    for x in range(W):
        for y in range(H):
            cnt += work(x,y)
    print(cnt)

Python: import sys
sys.setrecursionlimit(10**7)

def dfs(sx,sy):
  stack=[[sx,sy]]
  while(stack):
    x,y=stack.pop()
 
    move=[[x,y],[x,y-1],[x,y+1],[x+1,y],[x-1,y],[x-1,y-1],[x+1,y+1],[x+1,y-1],[x-1,y+1]]
 
    for mx,my in move:
      if not(0<=mx<=h-1) or not(0<=my<=w-1):
        continue

      elif l[mx][my]==1:
        stack.append([mx,my])
        l[mx][my]=0

while(True):
  w,h=[int(x) for x in input().rstrip().split()]
  if w==h==0:
    break

  l=[]
  for i in range(h):
    c=[int(x) for x in input().rstrip().split()]
    l.append(c)
    
  ans=0
  for i in range(h):
    for j in range(w):
      if l[i][j]==1:
        dfs(i,j)
        ans+=1
  print(ans)

Python: 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 < h and 0 <= ny < w and c[nx][ny] == 1:
                dfs(nx, ny)

while True:
    w, h = map(int,input().split())
    if w == 0 and h == 0 :
        break
    
    c = [list(map(int,input().split())) for j in range(h)]
    count = 0
    
    for i in range(h):
        for j in range(w):
            if c[i][j] == 1:
                dfs(i,j)
                count += 1

    print(count)

Python: import sys
sys.setrecursionlimit(100000)

while True:
    w, h = map(int, input().split())
    if w == 0:
        break
    field = [list(map(int, input().split())) for _ in range(h)]
    searched = [[False for _ in range(w)] for __ in range(h)]
    
    islands = 0
    
    def search(x, y):
        if not (0 <= x < w and 0 <= y < h):
            return 0
        if searched[y][x]:
            return 0
        searched[y][x] = True
        if field[y][x] == 0:
            return 0
        
        search(x-1, y-1)
        search(x-1, y)
        search(x-1, y+1)
        search(x, y-1)
        search(x, y+1)
        search(x+1, y-1)
        search(x+1, y)
        search(x+1, y+1)
        
        return 1
        
    for y in range(h):
        for x in range(w):
            if not searched[y][x]:
                islands += search(x, y)
                    
    print(islands)