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(20000)
w,h=list(map(int,input().split()))
def simaserach(i,j):
    if color[i][j]=="w":
        color[i][j]="g"
        if i>=1:
            if sima[i-1][j]==1:
                simaserach(i-1,j)
            if j>=1:
                if sima[i-1][j-1]==1:
                    simaserach(i-1,j-1)
            if j<=w-2:
                if sima[i-1][j+1]==1:
                    simaserach(i-1,j+1)
        if j>=1:
            if sima[i][j-1]==1:
                simaserach(i,j-1)
        if j<=w-2:
            if sima[i][j+1]==1:
                simaserach(i,j+1)
        if i<=h-2:
            if j>=1:
                if sima[i+1][j-1]==1:
                    simaserach(i+1,j-1)
            if sima[i+1][j]==1:
                simaserach(i+1,j)
            if j<=w-2:
                if sima[i+1][j+1]:
                    simaserach(i+1,j+1)

while(w!=0):
    count=0
    color = [["w" for i in range(w)] for j in range(h)]
    sima=[[]for i in range(h)]
    for i in range(h):
        a=list(map(int,input().split()))
        sima[i]=a
    for i in range(h):
        for j in range(w):
            if sima[i][j]==1 and color[i][j]=="w":
                simaserach(i,j)
                count+=1
    print(count)
    w, h = list(map(int, input().split()))

Python: import sys
sys.setrecursionlimit(10**6)
from itertools import product
while True:
  w,h = map(int,input().split())
  if w == h == 0: exit()
  islands = []
  for _ in range(h):
    islands.append(list(map(int,input().split())))

  seen = [ [False]*w for _ in range(h) ]
  def dfs(row,col):
    seen[row][col] = True

    for x,y in product(range(-1,2), repeat=2):
      if x==0 and y==0: continue
      nrow, ncol = row+x, col+y
      if nrow>=h or nrow<0 or ncol>=w or ncol<0: continue
      if seen[nrow][ncol]: continue

      if islands[nrow][ncol] == 1:
        dfs(nrow, ncol)

  res = 0
  for i in range(h):
    for j in range(w):
      if islands[i][j] == 1 and not seen[i][j]:
        dfs(i,j)
        res += 1

  print(res)

Python: import sys
sys.setrecursionlimit(2500)
 
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 and 0 <= ny < h and c[ny][nx] == '1':
            erase(nx, ny)
 
while True:
    w, h = map(int, input().split())
    if w == h == 0:
        break
    c = [sys.stdin.readline().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: import sys
sys.setrecursionlimit(10000)
k = [-1,0,1]
def search(x,y,m):
    if x<0 or x>=len(m[0]) or y<0 or y>=len(m): return
    if m[y][x]==0: return
    m[y][x] = 0
    for i in k:
        for j in k:
            search(x+i,y+j,m)

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

Python: import sys


def dfs(M, i, j, h, w):
    M[i][j] = 0
    for dy in range(-1, 2):
        for dx in range(-1, 2):
            ny, nx = i+dy, j+dx
            if 0 <= ny < h and 0 <= nx < w and M[ny][nx] == 1:
                dfs(M, ny, nx, h, w)


def search(M, w, h):
    count = 0
    for i in range(h):
        for j in range(w):
            if M[i][j] == 1:
                dfs(M, i, j, h, w)
                count += 1
    return count


if __name__ == "__main__":
    sys.setrecursionlimit(50*50)
    ans = []
    while True:
        w, h = map(int, input().split())
        if w == 0 and h == 0:
            break
        M = [[int(ipt) for ipt in input().split()] for _ in range(h)]
        ans.append(search(M, w, h))

    for a in ans:
        print(a)

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)