Go: package main

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

var (
	readString func() string
	readBytes  func() []byte
	stdout     *bufio.Writer
)

func init() {
	readString, readBytes = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) (func() string, func() []byte) {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), math.MaxInt32)
	r.Split(bufio.ScanWords)

	f1 := func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
	f2 := func() []byte {
		return []byte(f1())
	}
	return f1, f2
}

func readInt() int {
	return int(readInt64())
}

func readInt64() int64 {
	i, err := strconv.ParseInt(readString(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(readString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(stdout, f, args...)
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdout, args...)
}

func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func min64(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func max64(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func abs64(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func gcd64(a, b int64) int64 {
	if b == 0 {
		return a
	}
	return gcd64(b, a%b)
}

// readString() string
// readInt() int
// readInt64() int64
// readFloat64() float64

// -----------------------------------------------------------------------------

func main() {
	defer stdout.Flush()

	for {
		ans, ok := solve()
		if !ok {
			break
		}
		println(ans)
	}

}

func solve() (int, bool) {
	w := readInt()
	h := readInt()
	if w == 0 && h == 0 {
		return 0, false
	}

	c := make([][]int, h+2)
	c[0] = make([]int, w+2)
	c[h+1] = make([]int, w+2)
	for i := 1; i-1 < h; i++ {
		c[i] = make([]int, w+2)
		for j := 1; j-1 < w; j++ {
			c[i][j] = readInt()
		}
	}

	var ans int
	for i := 1; i-1 < h; i++ {
		for j := 1; j-1 < w; j++ {
			if 0 < c[i][j] {
				ans++
				dfs(c, i, j)
			}
		}
	}
	return ans, true
}

func dfs(c [][]int, y, x int) {
	c[y][x] = 0
	dx := []int{-1, 0, 1, -1, 1, -1, 0, 1}
	dy := []int{-1, -1, -1, 0, 0, 1, 1, 1}
	for i := range dx {
		nx := x + dx[i]
		ny := y + dy[i]
		if 0 < c[ny][nx] {
			dfs(c, ny, nx)
		}
	}
}

// -----------------------------------------------------------------------------

Python: from collections import deque
while True:
    w, h = map(int, input().split())
    if w == 0 and h == 0:
        break
    areas = [list(map(int, input().split())) for _ in range(h)]

    # print(areas)

    # 島の数を出す。
    # 島の定義は陸地続きであること。ただし、斜めもみて、陸だったらそれは島
    # 左上からスタートして、陸続きのものは飛ばす

    move_positions = [[-1, -1], [-1, 0], [-1, 1],
                      [0, -1], [0, 1], [1, -1], [1, 0], [1, 1]]
    count = 0
    queue = deque([])
    for i in range(h):
        for j in range(w):
            start_position = [i, j]
            queue.append(start_position)
            has_island = False
            while queue:
                now_position = queue.popleft()
                if areas[now_position[0]][now_position[1]] == 0:
                    continue
                has_island = True
                areas[now_position[0]][now_position[1]] = 0
                for move_position in move_positions:
                    next_position = [now_position[0] + move_position[0],
                                     now_position[1] + move_position[1]]
                    if 0 <= next_position[0] and next_position[0] < h and 0 <= next_position[1] and next_position[1] < w:
                        queue.append(next_position)
            if has_island:
                count += 1
    print(count)

Python: # -*- coding: utf-8 -*-
"""
How Many Islands?
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1160&lang=jp

"""
import sys
from sys import stdin
from collections import deque
input = stdin.readline


def bfs(data, sx, sy, w, h):
    dy = [-1, 1, 0, 0, -1, -1, 1, 1]
    dx = [0, 0, -1, 1, -1, 1, -1, 1]
    Q = deque()
    Q.append((sx, sy))
    data[sy][sx] = '-'
    while Q:
        cx, cy = Q.popleft()        #  現在地の座標
        for i in range(8):
            nx = cx + dx[i]
            ny = cy + dy[i]
            if (not 0 <= nx < w) or (not 0 <= ny < h):
                continue
            elif data[ny][nx] == '1':
                Q.append((nx, ny))
                data[ny][nx] = '-'


def solve(field, w, h):
    ans = 0
    for y in range(h):
        for x in range(w):
            if field[y][x] == '1':
                bfs(field, x, y, w , h)
                ans += 1
    return ans


def main(args):
    while True:
        w, h = map(int, input().split())
        if w == 0 and h == 0:
            break
        field = []
        for _ in range(h):
            field.append([x for x in input().split()])
        ans = solve(field, w, h)
        print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

def dfs(s,Map,H,W,c):
    dxdy = [(1,0),(-1,0),(0,1),(0,-1),(1,1),(-1,-1),(-1,1),(1,-1)]
    for i in range(len(dxdy)):
        Map[s[0]][s[1]] = c
        nextPos = (s[0]+dxdy[i][0],s[1]+dxdy[i][1])
        if nextPos[0] >= 0 and nextPos[1] >= 0 and nextPos[0] < H and nextPos[1] < W:
            if Map[nextPos[0]][nextPos[1]] == 1:
                dfs(nextPos,Map,H,W,c)

while True:
    W,H = map(int,input().split(" "))
    if W == 0 and H == 0:
        break
    Map = [list(map(int,input().split())) for i in range(0,H)]
    c = 1
    for i in range(H):
        for j in range(W):
            if Map[i][j] == 1:
                c += 1
                dfs((i,j),Map,H,W,c)
    print(c-1)

Python: import queue
def main():
	count_list = []

	w,h = map(int,input().split())
	while not(w == 0 and h == 0):
		data = []
		count = 0
		for _ in range(h):
			data.append(list(map(int,input().split())))

		for row,i in zip(data,range(len(data))):
			for cell,j in zip(row,range(len(row))):
				if cell == 1:
					fill_sea(data,j,i,w,h)
					count += 1

		w,h = map(int,input().split())
		count_list.append(count)




	for i in count_list:
		print(i)


def fill_sea(data,x,y,w,h):
	q = queue.LifoQueue()
	q.put((x,y))
	while not q.empty():
		current_cell = q.get()
		data[current_cell[1]][current_cell[0]] = 0


		for i in [-1,0,1]:
			if current_cell[1]+i <= -1 or  current_cell[1]+i >= h:
				continue
			for j in [-1,0,1]:
				if i == 0 and j == 0:
					continue
				if current_cell[0]+j <= -1 or current_cell[0]+j >= w :
					continue

				if data[current_cell[1]+i][current_cell[0]+j] == 1:
					q.put((current_cell[0]+j,current_cell[1]+i))


if __name__ == '__main__':
	main()