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(500000)

def allblue(H, W, C):
    for h in range(H):
        for w in range(W):
            if C[h][w] == 1:
                return (h, w)
    return (-1, -1)

directions = [(0, 1), (0, -1), (1, 1), (1, 0), (1, -1), (-1, -1), (-1, 0), (-1, 1)]
def dfs(h, w, C):
    C[h][w] = 0
    for dh, dw in directions:
        if 0 <= h+dh < H and 0 <= w+dw < W and C[h+dh][w+dw] == 1:
            dfs(h+dh, w+dw, C)

while True:
    W, H = map(int, input().split())
    if W == 0 and H == 0:
        exit()
    C = [list(map(int, input().split())) for i in range(H)]

    ans = 0
    while True:
        h, w = allblue(H, W, C)
        if (h, w) == (-1, -1):
            break
        dfs(h, w, C)
        ans += 1

    print(ans)

Python: import sys
sys.setrecursionlimit(10000)
def search(x,y,m):
    if not(0<=x<len(m[0]) and 0<=y<len(m)) or m[y][x]=='0': return
    m[y][x] = '0'
    for dx,dy in [[-1,-1],[0,-1],[1,-1],[-1,0],[1,0],[-1,1],[0,1],[1,1]]:
        search(x+dx,y+dy,m)
while True:
    w,h = map(int,input().split())
    if w==h==0: break
    m = [input().split() for _ in range(h)]
    c = 0
    for y in range(h):
        for x in range(w):
            if m[y][x]=='1':
                c += 1
                search(x,y,m)
    print(c)

Python: 
if __name__ == "__main__":
    while True:
        w, h = map(int, input().split())
        if w == 0 and h == 0:
            break
        c = []
        for _ in range(h):
            hi = list(map(int, input().split()))
            c.append(hi)
        
        visited = []
        for _ in range(h):
            hi = [False] * w
            visited.append(hi)
        
        st = []
        ans = 0

        for s_row in range(h):
            for s_col in range(w):
                if c[s_row][s_col] != 0 and not visited[s_row][s_col]:
                    st = [(s_row, s_col)]
                    while st:
                        now = st.pop()
                        for i in range(-1, 2):
                            for j in range(-1, 2):
                                if now[0] + i >= 0 and now[0] + i < h and now[1] + j >= 0 and now[1] + j < w and not visited[now[0] + i][now[1] + j] and c[now[0] + i][now[1] + j] != 0:
                                    visited[now[0] + i][now[1] + j] = True
                                    st.append((now[0] + i, now[1] + j))
                    ans += 1
        print(ans)

Python: import sys
sys.setrecursionlimit(1000000)

while(1):
    w, h = map(int, input().split())
    if w == 0 and h == 0:
        break
    else:
        maps = [[-1]*(w+2)] + [([-1] + list(map(int, input().split())) + [-1]) for _ in range(h)] + [[-1]*(w+2)]
        seen = [[True]*(w+2)] + [([True] + [False]*w + [True]) for _ in range(h)] + [[True]*(w+2)]
        dxy = ((-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1))
        
        
        def dfs(y, x):
            seen[y][x] = True
            for i in dxy:
                if seen[y+i[0]][x+i[1]] is False:
                    if maps[y+i[0]][x+i[1]] == 0:
                        seen[y+i[0]][x+i[1]] = True
                    else:
                        dfs(y+i[0], x+i[1])
        
        now = 0
        ans = 0
        while now < w * h:
            y = now // w + 1
            x = now % w + 1
            if seen[y][x] is False:
                if maps[y][x] == 0:
                    seen[y][x] = True
                else:
                    ans += 1
                    dfs(y, x)
            
            now += 1
        
        print(ans)

Python: import sys
sys.setrecursionlimit(10**8)

ans = []

def dfs(x, y):
    c[x][y] = 0

    for dx in range(-1, 2):
        for dy in range(-1, 2):
            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

    count = 0

    c = [[] for _ in range(h)]
    for i in range(h):
        if w == 1:
            c[i] = [int(input())]
        else:
            c[i] = list(map(int, input().split()))

    for x in range(h):
        for y in range(w):
            if c[x][y] == 1:
                dfs(x, y)
                count += 1

    ans.append(count)

for i in ans:
    print(i)

Python: import sys
sys.setrecursionlimit(5000)

dx = [1, 0, -1]
dy = [1, 0, -1]

def dfs(area, x, y):
    area[x][y] = 0
    for i in dx:
        for j in dy:
            next_x = x + i
            next_y = y + j
            if area[next_x][next_y] == 1:
                dfs(area, next_x, next_y)

def solver(w, h):
    ans = 0
    area = [[0]*(w+2)]
    for i in range(h):
        area.append([0]+list(map(int, input().split()))+[0])
    area.append([0]*(w+2))

    for i in range(1, h+1):
        for j in range(1, w+1):
            if area[i][j] == 1:
                ans += 1
                dfs(area, i, j)
    return ans

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