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: def erase(x, y):
    c[y][x] = '0'
    for dx, dy in ((1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)):
        nx, ny = x + dx, y + dy
        if 0 <= nx <= w -1 and 0 <= ny <= h - 1:
            if c[ny][nx] == '1':
                erase(nx, ny)

while True:
    w, h = map(int, input().split())
    c = [[i for i in input().split()] for _ in range(h)]
    ans = 0
    for y in range(h):
        for x in range(w):
            if c[y][x] == '1':
                ans += 1
                erase(x, y)
    print(ans)

Python: from collections import deque
while True:
    w,h=map(int,input().split())
    if w==0 and h==0:
        exit()
    field=[input().split() for i in range(h)]
    
    option=deque()
    for i in range(h):
        for j in range(w):
            if field[i][j]=="1":
                option.append([i,j])
                break
        else:
            continue
        break
    completed=[[0]*w for i in range(h)]
    cnt=1
    while option:
        y,x=option.pop()
        completed[y][x]=cnt
        for dy,dx in ((-1,0),(1,0),(0,-1),(0,1),(-1,-1),(1,-1),(-1,1),(1,1)):
            if 0<=y+dy<=h-1 and 0<=x+dx<=w-1 and field[y+dy][x+dx]=="1" and completed[y+dy][x+dx]==0:
                ny=y+dy
                nx=x+dx
                option.append([ny,nx])
        if len(option)==0:
            for i in range(h):
                for j in range(w):
                    if field[i][j]=="1" and completed[i][j]==0:
                        option.append([i,j])
                        cnt+=1
                        break
                else:
                    continue
                break
    ans=0
    for i in completed:
        tmp=max(i)
        ans=max(ans,tmp)
    print(ans)

Python: import sys
sys.setrecursionlimit(2500)
def dfs(i, j):
    global visited
    visited[i][j] = True
    for ii in [i - 1, i, i + 1]:
        for jj in [j - 1, j, j + 1]:
            if c[ii][jj] and not visited[ii][jj]:
                dfs(ii, jj)

w_list = []
h_list = []
c_list = []
while True:
    w, h = [int(x) for x in input().split()]
    if w == h == 0: break
    # dfsの条件分岐を減らすために、周りを海で囲む
    c = [[0 for _ in range(w + 2)]] + \
        [[0] + [int(x) for x in input().split()] + [0] for _ in range(h)] + \
        [[0 for _ in range(w + 2)]]
    w_list.append(w)
    h_list.append(h)
    c_list.append(c)

for w, h, c in zip(w_list, h_list, c_list):
    visited = [[False for _ in range(w + 2)] for _ in range(h + 2)]
    ans = 0
    for i in range(1, h + 1):
        for j in range(1, w + 1):
            if c[i][j] == 1 and not visited[i][j]:
                ans += 1
                dfs(i, j)
    print(ans)

Python: from itertools import product
import sys

sys.setrecursionlimit(10 ** 6)

def solve(H, W, C):
    def dfs(h, w):
        if h < 0 or h >= H or w < 0 or w >= W:
            return 0
        elif C[h][w] == 0:
            return 0
        else:
            C[h][w] = 0
            for dh, dw in product((1, 0, -1), repeat = 2):
                dfs(h+dh, w+dw)
            return 1
    
    cnt = 0

    for h in range(H):
        for w in range(W):
            cnt += dfs(h, w)

    print(cnt)

A = []
while True:
    W, H = [int(i) for i in input().split()]
    if W == 0 and H == 0:
        break
    else:
        C = [[int(i) for i in input().split()] for j in range(H)]
        A.append((H, W, C))

for a in A:
    solve(*a)

Python: import sys
sys.setrecursionlimit(10 ** 7)
def dfs(h, w, grid):
    grid[h][w] = 0

    # 八方向を探索
    for dh in range(-1, 2):
        for dw in range(-1, 2):
            nh = dh + h
            nw = dw + w

            # 場外だった場合はするー(番兵)
            if nh < 0 or nw < 0:
                continue
            if grid[nh][nw] == 0:
                continue
            # 次に進む
            dfs(nh, nw, grid)
while True:
    grid = []
    W, H = map(int, input().split())
    if W == 0 and H == 0:
        break
    grid.append([0] * (W+2))
    grid += [[0] + list(map(int, input().split())) + [0] for _ in range(H)]
    grid.append([0] * (W+2))

    cnt = 0
    for h in range(1, H+1):
        for w in range(1, W+1):
            if grid[h][w] == 0:
                continue
            dfs(h, w, grid)
            cnt += 1
    print(cnt)

Python: h,w=1,1

count=0
anser=0

def search(x,y):
    #マップの外側か壁の場合は何もしない
    #print(x,y)

    global count
    count+=1
    if x<0 or x>w-1 or y<0 or y>h-1 or map_data[y][x]==0:
 
        return
        
    
    #以前に到達していたら何もしない
    if reached[y][x] ==0:
         return

    reached[y][x]=0
    
    #print("aa")



    search(x+1,y)#右
    search(x-1,y)#左
    search(x,y+1)#上
    search(x,y-1)#下
    search(x-1,y-1)
    search(x-1,y+1)
    search(x+1,y-1)
    search(x+1,y+1)



while h!=0 and w!=0: 
    anser=0
    count=1
    #グラフの入力方法------

    w,h=map(int ,raw_input().split())
    if h==0 and w==0:
        break

    map_data = [[0]*w for _ in range(h)]
    reached = [[1]*w for _ in range(h)]

    for i in range(h):
        ct = raw_input().split()
       
        for j in range(w):
            map_data[i][j] = int(ct[j])
            reached [i][j]=int(ct[j])
            if ct[j]==1:
                sx=j
                sy=i

    t=0
    a=0
    while a<=h:
       if 1 in reached[t%h]:         
            search(reached[t%h].index(1),t%h)
            anser+=1
            #print("count",count)
            count=1
            a=0
       elif count==h:
                break
       t+=1
       a+=1

    print(anser)