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: import sys
sys.setrecursionlimit(10000)
def f(x,y):
    if 0<=x<w and 0<=y<h and a[y][x]=='1':
        a[y][x]='0'
        for dx,dy in[[-1,0],[1,0],[0,-1],[0,1],[-1,-1],[1,-1],[-1,1],[1,1]]:f(x+dx,y+dy)
while 1:
    w,h=map(int,input().split())
    if w==0:break
    a=[input().split() for _ in[0]*h];b=0
    for i in range(w):
        for j in range(h):
            if a[j][i]=='1':
                b+=1;f(i,j)
    print(b)

Python: import sys
while True:
    sys.setrecursionlimit(10000000)
    w,h=map(int,input().split())
    if w==0 and h==0:
        sys.exit()

    field=[list(map(int,input().split())) for i in range(h)]

    def dfs(x,y):
        if not(0<=x<h) or not(0<=y<w):
            return
        elif field[x][y]==0:
            return
        field[x][y]=0
        for i in range(3):
            for j in range(3):
                dfs(x-1+i,y-1+j)
        return 0
    ans=0
    for i in range(h):
        for j in range(w):
            if field[i][j]==1:
                dfs(i,j)
                ans+=1     
    print(ans)

Python: import sys

sys.setrecursionlimit(2 * 10**6)


def inpl():
    return list(map(int, input().split()))


def solve(mp, w, h):
    def dfs(ny, nx):
        if mp[ny][nx] == 0:
            flag[ny][nx] = -1
            return
        elif visit[ny * w + nx]:
            return
        visit[ny * w + nx] = True

        for dx in [-1, 0, 1]:
            for dy in [-1, 0, 1]:
                if dx == dy == 0:
                    continue
                elif mp[ny + dy][nx + dx] == 0:
                    continue
                flag[ny + dy][nx + dx] = min(flag[ny][nx], flag[ny + dy][nx + dx])
                dfs(ny + dy, nx + dx)

    mp = [[0] + m + [0] for m in mp]
    mp = [[0] * (w + 2)] + mp + [[0] * (w + 2)]
    flag = [[-1] + [i + j * w for i in range(w)] + [-1] for j in range(h)]
    flag = [[-1] * (w + 2)] + flag + [[-1] * (w + 2)]
    visit = [False] * (w + 2) * (h + 2)

    for ny in range(h):
        for nx in range(w):
            dfs(ny + 1, nx + 1)
    # print(flag)

    ret = []
    for f in flag:
        ret += [i for i in f if i != -1]
    return len(set(ret))


ans = []
while True:
    w, h = inpl()
    if w == h == 0:
        break
    tmp = [inpl() for i in range(h)]
    ans.append(solve(tmp, w, h))

for a in ans:
    print(a)

Python: import sys
sys.setrecursionlimit(100000)

def islands ( x, y):
    s[y][x] = '0'
    for dx, dy in ((1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)):
        xx,yy = x+dx , y+dy
        if 0<=xx<w and 0<=yy<h and s[yy][xx]=='1':
            islands(xx,yy)
            
while True:
    w, h = map(int, input().split())
    count = 0

    if w==0 and h==0:
        break
    
    s = [[i for i in input().split()] for _ in range(h)]


    for i in range (w):
        for j in range(h):
            if s[j][i] == '1':
                islands( i, j)
                count += 1

    print(count)

Python: # https://onlinejudge.u-aizu.ac.jp/problems/1160

A = []
w = 0
h = 0


def walk(i, j):
    global A
    stack = [(i, j)]
    while True:
        i, j = stack.pop()
        A[i][j] = 0
        for ii in range(i-1, i+2):
            for jj in range(j-1, j+2):
                if ii < 0 or h <= ii:
                    continue
                if jj < 0 or w <= jj:
                    continue
                if A[ii][jj] == 0:
                    continue
                else:
                    stack.append((ii, jj))

        if len(stack) == 0:
            break


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

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

        cnt = 0
        for i in range(h):
            for j in range(w):
                if A[i][j] == 1:
                    cnt += 1
                    walk(i, j)

        print(cnt)

Python: # -*- coding: utf-8 -*-
def dfs(x,y):
    c[x][y] = 0
    for dx in [-1,0,1]:
        for dy in [-1,0,1]:
            nx = x + dx
            ny = y + dy
            if 0 <= nx < h and 0 <= ny < w and c[nx][ny] == 1:
                dfs(nx, ny)

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

    print(count)