Go: // AOJ 1160: How Many Islands? http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1160

package main

import (
	"bufio"
	"container/list"
	"fmt"
	"os"
	"strconv"
)

var SEA = 0
var LAND = 1

func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

func discoverIslands(M, V [][]int, H, W int) int {
	// 島を探す
	queue := list.New()
	islands := 0
	for i := 1; i <= H; i++ {
		for j := 1; j <= W; j++ {
			// 訪問済みの土地ならスキップ
			if V[i][j] == 1 {
				continue
			}

			// 訪問中の土地が海なら訪問済みにしてスキップ
			if M[i][j] == SEA {
				V[i][j] = 1
				continue
			}

			// 未訪問の陸地が見つかったので
			// 島の数を1つ増やし、この陸地から辿れる陸地を訪問していく
			islands++
			queue.PushBack([]int{i, j})

			for queue.Len() > 0 {
				cur := queue.Remove(queue.Front()).([]int)
				h, w := cur[0], cur[1]
				if V[h][w] == 1 {
					continue
				}
				V[h][w] = 1

				// 全方向に未訪問の陸地がないか探索
				for v := -1; v <= 1; v++ {
					for l := -1; l <= 1; l++ {
						dh := h + v
						dw := w + l
						if M[dh][dw] == LAND && V[dh][dw] == 0 {
							queue.PushBack([]int{dh, dw})
						}
					}
				}
				/*
					if M[h-1][w] == LAND {
						queue.PushBack([]int{h - 1, w})
					}
					if M[h-1][w+1] == LAND {
						queue.PushBack([]int{h - 1, w + 1})
					}
					if M[h][w+1] == LAND {
						queue.PushBack([]int{h, w + 1})
					}
					if M[h+1][w+1] == LAND {
						queue.PushBack([]int{h + 1, w + 1})
					}
					if M[h+1][w] == LAND {
						queue.PushBack([]int{h + 1, w})
					}
					if M[h+1][w-1] == LAND {
						queue.PushBack([]int{h + 1, w - 1})
					}
					if M[h][w-1] == LAND {
						queue.PushBack([]int{h, w - 1})
					}
					if M[h-1][w-1] == LAND {
						queue.PushBack([]int{h - 1, w - 1})
					}
				*/
			}
		}
	}
	return islands
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	for {
		W, H := nextInt(sc), nextInt(sc)

		if W == 0 && H == 0 {
			break
		}
		// Initialize map and visted list
		M := make([][]int, H+2)
		V := make([][]int, H+2)
		for i := 0; i < H+2; i++ {
			M[i] = make([]int, W+2)
			V[i] = make([]int, W+2)
		}
		for i := 1; i <= H; i++ {
			for j := 1; j <= W; j++ {
				M[i][j] = nextInt(sc)
			}
		}

		islands := discoverIslands(M, V, H, W)

		fmt.Println(islands)
	}
}

Python: # =============================================================================
#　How many Islands?
# =============================================================================
import sys
sys.setrecursionlimit(10**8)
while True:
    W,H=map(int,input().split())
    if W==0 and H==0:
        break
    field=[list(map(int,input().split())) for _ in range(H)]

    MV=[(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)]

    def dfs(field,h,w):
        global seen
        field[h][w]=0
        for mv in MV:
            nh=h+mv[0];nw=w+mv[1]
            if nh<0 or nh>=H or nw<0 or nw>=W:
                continue
            if field[nh][nw]==0:
                continue
            dfs(field,nh,nw)

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

Python: # -*- coding: utf-8 -*-
#150 島は幾つある？
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: while True:
    w,h=map(int,input().split())
    if h==0 and w==0:
        break
    c=[list(map(int,input().split())) for _ in [0]*h]
    
    visit=[[c[i][j]==0 for j in range(w)] for i in range(h)]
    d=[(1,0),(-1,0),(0,1),(0,-1),(1,1),(1,-1),(-1,1),(-1,-1)]
    cnt=0    
    for i in range(h):
        for j in range(w):
            if visit[i][j]==True:
                continue
            q=[[i,j]]
            visit[i][j]=True
            while q:
                k,l=q.pop()
                for dx,dy in d:
                    if not ((0<=k+dx<h) and (0<=l+dy<w)):
                        continue
                    if visit[k+dx][l+dy]==True:
                        continue
                    q.append([k+dx,l+dy])
                    visit[k+dx][l+dy]=True
            cnt+=1            
    print(cnt)

Python: m = []

def walk(i,j):
    if i < 0 or j < 0 \
            or i >= len(m) or j >= len(m[i]):
                return
    if m[i][j] == 0:
        return
    m[i][j] = 0
    for k in range(-1,2):
        for l in range(-1,2):
            walk(i+k,j+l)

while True:
    w, h = map(int, input().split())
    if w == 0: break
    for i in range(h):
        m.append(list(map(int, input().split())))
    ans = 0
    for i in range(len(m)):
        for j in range(len(m[i])):
            if m[i][j] == 1:
                walk(i,j)
                ans += 1
    print(ans)
    m = []

Python: from collections import deque
def dfs(G,v,h,w):
    stack = deque([v])
    connected = set([v])
    while stack:
        u = stack.popleft()
        x,y = u
        dx = [-1,0,1]
        dy = [-1,0,1]
        for i in range(3):
            for j in range(3):
                s = x + dx[i]
                t = y + dy[j]
                if 0 <= s < h and 0 <= t < w:
                    if G[s][t] == 1:
                        if (s,t) not in connected:
                            stack.appendleft((s,t))
                            connected.add((s,t))
    return connected

def solve(C,h,w):
    node = set()
    ans = 0
    for i in range(h):
      for j in range(w):
        if C[i][j] == 1 and (i,j) not in node:
          node = node|dfs(C,(i,j),h,w)
          ans += 1
    print(ans)

def main():
    h = 0
    w = 0
    while h >= 0 and w >= 0:
        w,h = map(int,input().split(" "))
        if h == w == 0:
            return
        C = [list(map(int,input().split(" "))) for _ in range(h)]
        solve(C,h,w)
  

if __name__ == "__main__":
    main()

Python: def solve():
    w, h = [int(x) for x in input().split()]
    if w == h == 0:
        return False
    field = [[int(x) for x in input().split()] for _ in range(h)]

    ans = 0
    for x in range(w):
        for y in range(h):
            if field[y][x] > 0:
                stack = []
                mark(field, w, h, x, y, stack)
                while stack:
                    p, q = stack.pop()
                    mark(field, w, h, p, q, stack)
                    
                ans += 1
    print(ans)
    return True



def mark(field, w, h, x, y, stack):
    if x < 0 or x >= w or y < 0 or y >= h:
        return

    if field[y][x] != 1:
        return

    field[y][x] = -1

    stack.append((x+1, y+1))
    stack.append((x+1, y))
    stack.append((x+1, y-1))
    stack.append((x, y+1))
    stack.append((x, y))
    stack.append((x, y-1))
    stack.append((x-1, y+1))
    stack.append((x-1, y))
    stack.append((x-1, y-1))
    

while solve():
    pass