Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

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)

Python: from collections import deque
import sys
input = sys.stdin.readline

w = []
h = []
dataset = []
while True:
    wt, ht = map(int, input().split())
    if wt==0 and ht==0:
        break
    w.append(wt)
    h.append(ht)
    subset = [[0]*(wt+2) for _ in range(ht+2)]
    for i in range(1, ht + 1):
        inls = [0] + list(map(int, input().split())) + [0]
        for j in range(1, wt + 1):
            subset[i][j] = inls[j]
    dataset.append(subset)

for i in range(len(dataset)):
    subset = dataset[i]
    w_ = w[i]
    h_ = h[i]
    idxs = []
    for row in range(1, h_+1):
        for col in range(1, w_+1):
            if subset[row][col] == 1:
                idxs.append((row, col))
    
    graph = {idx: deque() for idx in idxs}
    for idx in idxs:
        x = idx[0]
        y = idx[1]
        surroundings = [(x+1, y), (x+1, y+1), (x, y+1), (x-1, y+1)
                         ,(x-1, y), (x-1, y-1), (x, y-1), (x+1, y-1)]
        for surrounding in surroundings:
            if subset[surrounding[0]][surrounding[1]] == 1:
                graph[idx].append(surrounding)
    
    seen = [[0]*(w_+2) for _ in range(h_+2)]
    stack = []
    def dfs(idx):
        seen[idx[0]][idx[1]] = 1
        stack.append(idx)
        while stack:
            s = stack[-1]
            if not graph[s]:
                stack.pop()
                continue
            
            g = graph[s].popleft()
            if seen[g[0]][g[1]]:
                continue
            seen[g[0]][g[1]] = 1
            stack.append(g)

    island_count = 0
    for idx in idxs:
        if not seen[idx[0]][idx[1]]:
            dfs(idx)
            island_count += 1
    print(island_count)

Python: import sys

sys.setrecursionlimit(3000)

while True:

    w, h = map(int, input().split())

    if w == 0 and h == 0:
        exit() 

    C = []
    for i in range(h):
        c = list(map(int, input().split()))
        C.append(c)

    def is_island(i, j):
        if 0 <= i < h and 0 <= j < w and C[i][j] == 1:
            C[i][j] = 0
            return True
        else:
            return False

    def walk_to(i, j):
        if is_island(i - 1, j):
            walk_to(i - 1, j)
        if is_island(i - 1, j - 1):
            walk_to(i - 1, j - 1)
        if is_island(i, j - 1):
            walk_to(i, j - 1)
        if is_island(i + 1, j - 1):
            walk_to(i + 1, j - 1)
        if is_island(i + 1, j):
            walk_to(i + 1, j)
        if is_island(i + 1, j + 1):
            walk_to(i + 1, j + 1)
        if is_island(i, j + 1):
            walk_to(i, j + 1)
        if is_island(i - 1, j + 1):
            walk_to(i - 1, j + 1)

    count = 0        
    for i in range(h):
        for j in range(w):
            if is_island(i, j):
                count = count + 1
                walk_to(i, j)

    print(count)

Python: import sys

sys.setrecursionlimit(10000)


dx = [0, 1, 0, -1, 1, 1, -1, -1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]


def dfs(field, w, h, height, width):
    field[height][width] = 0

    for i in range(8):
        nw = width + dx[i]
        nh = height + dy[i]

        if nw < 0 or nw >= w or nh < 0 or nh >= h:
            continue
        if field[nh][nw] == 0:
            continue

        dfs(field, w, h, nh, nw)
    return


def solve():
    ans = []
    while True:
        w, h = map(int, input().split())
        if w == h == 0:
            break

        field = [list(map(int, input().split())) for _ in range(h)]
        count = 0
        for c in range(h):
            for r in range(w):
                if field[c][r] == 1:
                    count += 1
                    dfs(field, w, h, c, r)

        ans.append(count)
    print(*ans, sep="\n")


if __name__ == "__main__":
    solve()