Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

Python: 
#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)

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)

Python: from sys import setrecursionlimit

setrecursionlimit(10 ** 9)

dir_h = [1, -1, 0, 0, 1, -1, -1, 1]
dir_w = [1, -1, 1, -1, 0, 0, 1, -1]


def dfs(i, j):

    if i < 0 or i >= h or j < 0 or j >= w:
        return

    if field[i][j] == 0 or seen[i][j] != 0:
        return

    seen[i][j] = 1

    for dh, dw in zip(dir_h, dir_w):
        nh = i + dh
        nw = j + dw

        dfs(nh, nw)


while True:
    w, h = map(int, input().split())

    if h == 0 and w == 0:
        break

    field = [list(map(int, input().split())) for _ in range(h)]
    seen = [[0 for _ in range(w)] for _ in range(h)]
    cnt = 0

    for i in range(h):
        for j in range(w):

            if field[i][j] == 0 or seen[i][j] != 0:
                continue

            cnt += 1
            dfs(i, j)

    print(cnt)

Python: # aoj_how_meny_island.py
import sys
sys.setrecursionlimit(500000)
def printseen():
    for i in seen:
        print(i)

def dsf(h,w):
    seen[h][w]=True
    for i in dh:
        for j in dw:
            nh = h+i
            nw = w+j
            if canGo(nh,nw,i,j):
                dsf(nh,nw)
    return 1

def canGo(nh,nw,i,j):
#    print("going to ",nh,nw)
    # staying
    if i == 0 and j == 0:return False
    # out of range
    if nh < 0 or nw < 0 or nh >= H or nw >= W:return False
    # if you seen skip it
    if seen[nh][nw]:return False
    # if you meet sea skip it 
    if C[nh][nw] == "0" : return False
#    print("can go to ",nh,nw)
    return True

while True:
    W,H = map(int,input().split())
    if W==0 and H==0:
        exit()
    C = []
    for i in range(H):
        C.append(input().split())
    seen = [[False for _ in range(W)] for _ in range(H)]
    dh = [-1,0,1]
    dw = [-1,0,1]
    cnt = 0
    for h in range(H):
        for w in range(W):
            # すでに見てる場所と、海は見ない
            if not seen[h][w] and not C[h][w]=="0":
                cnt += dsf(h,w)
    print(cnt)

Python: import sys
sys.setrecursionlimit(10**6)
ans = []
while True:
    w, h = map(int, input().split())
    if w == 0 and h == 0:
        break
    c = [list(map(int, input().split())) for _ in range(h)]
    # print(*c, sep='\n')
    dx = [0, -1, 1]
    dy = [0, -1, 1]
    seen = [[0 for _ in range(w)] for _ in range(h)]
    cnt = 0
    def dfs(y, x, seen):
        seen[y][x] = 1
        # print(x, y, *seen,sep='\n')
        # print('\n')

        for i in range(3):
            for j in range(3):
                if i == 0 and j == 0:
                    continue
                if 0 <= x+dx[i] < w and 0 <= y+dy[j] < h:
                    if c[y+dy[j]][x+dx[i]] == 1 and seen[y+dy[j]][x+dx[i]] == 0:
                        dfs(y+dy[j], x+dx[i], seen)

    for i in range(h):
        for j in range(w):
            if not (seen[i][j] == 1 or c[i][j] == 0):
                dfs(i, j, seen)
                cnt += 1

    ans.append(cnt)

print(*ans, sep='\n')