Go: ///
// File:  1160.go
// Author: ymiyamoto
//
// Created on Sun Mar  4 20:45:57 2018
//
package main

import (
	"fmt"
)

var w, h int
var graph [][]string

func dfs(visited [][]bool, x, y int) {
	visited[x][y] = true

	for i := -1; i <= 1; i++ {
		for j := -1; j <= 1; j++ {
			dx := x + i
			dy := y + j
			if 0 <= dx && dx < h && 0 <= dy && dy < w && graph[dx][dy] == "1" && !visited[dx][dy] {
				dfs(visited, dx, dy)
			}
		}
	}
}

func main() {
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			break
		}

		graph = make([][]string, h)
		for i := range graph {
			graph[i] = make([]string, w)
		}

		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				var s string
				fmt.Scan(&s)
				graph[i][j] = s
			}
		}

		visited := make([][]bool, h)
		for i := range visited {
			visited[i] = make([]bool, w)
		}

		count := 0
		for i := range graph {
			for j := range graph[i] {
				if graph[i][j] == "1" && !visited[i][j] {
					dfs(visited, i, j)
					count++
				}
			}
		}

		fmt.Println(count)
	}
}

Python: import sys

sys.setrecursionlimit(10**7)

while(True):
    # w, h <= 50
    w, h = map(int, input().split())
    if w == 0 and h == 0:
        break

    # 0=>海, 1=>陸
    island = [list(input().split()) for _ in range(h)]

    island_number = 0

    def dfs(y, x):
        if x < 0 or w <= x or y < 0 or h <= y:
            return

        if island[y][x] == "0":
            return

        island[y][x] = "0"

        dfs(y, x - 1)
        dfs(y, x + 1)
        dfs(y - 1, x)
        dfs(y + 1, x)
        dfs(y + 1, x + 1)
        dfs(y + 1, x - 1)
        dfs(y - 1, x + 1)
        dfs(y - 1, x - 1)



    # iは横軸 jは縦軸
    for i in range(w):
        for j in range(h):

            if island[j][i] == "1":
                dfs(j, i)
                island_number += 1

    print(island_number)

Python: from collections import deque

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

def count(chizu, start):
    stack = deque([start])
    while stack:
        y, x = stack.pop()
        for dxi, dyi in move:
            if not (0<=x+dxi<w and 0<=y+dyi<h) or chizu[y+dyi][x+dxi] == "0":
                continue
            else:
                stack.append((y+dyi, x+dxi))
        chizu[y][x] = "0"


while True:
    w, h = map(int,input().split())
    if w == 0:
        break
    
    island = [0]*h
    ans = 0
    for i in range(h):
        island[i] = list(input().split())
    
    for r in range(h):
        for c in range(w):
            if island[r][c] == "1":
                count(island, (r, c))
                ans += 1
    print(ans)

Python: #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

D = [(0,1),(0,-1),(1,0),(-1,0),(1,1),(1,-1),(-1,1),(-1,-1)]
def solve(w,h):
    def bfs(y,x):
        q = deque([(y,x)])
        while q:
            y,x = q.popleft()
            for dx,dy in D:
                ny,nx = y+dy,x+dx
                if 0 <= ny < h and 0 <= nx < w:
                    if c[ny][nx] and not d[ny][nx]:
                        d[ny][nx] = 1
                        q.append((ny,nx))
    c = LIR(h)
    d = [[0]*w for i in range(h)]
    ans = 0
    for y in range(h):
        for x in range(w):
            if c[y][x] and not d[y][x]:
                ans += 1
                d[y][x] = 1
                bfs(y,x)
    print(ans)
    return

#Solve
if __name__ == "__main__":
    while 1:
        w,h = LI()
        if w == h == 0:
            break
        solve(w,h)

Python: import sys
sys.setrecursionlimit(10**9)
def solve(w,h):
    G = [list(map(int,input().split())) for _ in range(h)]
    seen = [[False]*w for _ in range(h)]
    ans = 0
    def dfs(x,y):
        if seen[y][x]:
            return
        seen[y][x] = True
        for dx in range(-1,2):
            for dy in range(-1,2):
                nx = x + dx
                ny = y + dy
                if 0 <= nx < w and 0 <= ny < h:
                    if G[y][x] == 1:
                        dfs(nx,ny)
    for x in range(w):
        for y in range(h):
            if G[y][x] == 1 and seen[y][x] == False:
                dfs(x,y)
                ans += 1
    print(ans)


while True:
    w,h = map(int,input().split())
    if w == 0 and h == 0:
        break
    solve(w,h)

Python: import sys

sys.setrecursionlimit(10000)

def ironuri(x, y, t, img,h,w):
    if img[y][x]!=1:
        return 0

    img[y][x]=t
    
    if y<h-1:
        ironuri(x,y+1,t,img,h,w)
    if y>0:
        ironuri(x,y-1,t,img,h,w)
    if x<w-1:
        ironuri(x+1,y,t,img,h,w)
    if x>0:
        ironuri(x-1,y,t,img,h,w)

    if x>0 and y>0:
        ironuri(x-1,y-1,t,img,h,w)
    if x>0 and y<h-1:
        ironuri(x-1,y+1,t,img,h,w)
    if x<w-1 and y>0:
        ironuri(x+1,y-1,t,img,h,w)
    if x<w-1 and y<h-1:
        ironuri(x+1,y+1,t,img,h,w)

    
    return 1
    
while True:
    cheese=[]
    il=2
    w,h=map(int, input().split())
    if w==0 and h==0:
        break
    
    for i in range(h):
        ci=list(map(int, input().split()))
        cheese.append(ci)
    
    for i in range(h):
        for j in range(w):
            if(ironuri(j,i,il,cheese,h,w)):
                il+=1

    print(il-2)

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

import sys

sys.setrecursionlimit(10**6)


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 map_[y][x] == 0:
        return

    map_[y][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_ = [list(map(int, input().split())) for h in range(H)]
    island_num = 0
    for x in range(W):
        for y in range(H):
            if map_[y][x] == 1:
                DFS(x, y)
                island_num += 1
    print(island_num)

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


def dfs(y,x,h,w):
    graph[y][x] = 0
    for ny,nx in (y+1,x),(y-1,x),(y,x+1),(y,x-1),(y+1,x+1),(y-1,x-1),(y-1,x+1),(y+1,x-1):
        if not (0<=ny<h and 0<=nx<w) or graph[ny][nx] ==0:
            continue
        else:
            dfs(ny,nx,h,w)
    return 

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