Go: ///
// File:  1160.go
// Author: ymiyamoto
//
// Created on Sun Mar  4 20:45:57 2018
//
package main

import (
	"fmt"
)

var w, h int
var graph [][]string

func dfs(visited [][]bool, x, y int) {
	visited[x][y] = true

	for i := -1; i <= 1; i++ {
		for j := -1; j <= 1; j++ {
			dx := x + i
			dy := y + j
			if 0 <= dx && dx < h && 0 <= dy && dy < w && graph[dx][dy] == "1" && !visited[dx][dy] {
				dfs(visited, dx, dy)
			}
		}
	}
}

func main() {
	for {
		fmt.Scan(&w, &h)
		if w == 0 && h == 0 {
			break
		}

		graph = make([][]string, h)
		for i := range graph {
			graph[i] = make([]string, w)
		}

		for i := 0; i < h; i++ {
			for j := 0; j < w; j++ {
				var s string
				fmt.Scan(&s)
				graph[i][j] = s
			}
		}

		visited := make([][]bool, h)
		for i := range visited {
			visited[i] = make([]bool, w)
		}

		count := 0
		for i := range graph {
			for j := range graph[i] {
				if graph[i][j] == "1" && !visited[i][j] {
					dfs(visited, i, j)
					count++
				}
			}
		}

		fmt.Println(count)
	}
}

Python: from collections import deque

result = []

while True:
    w, h = map(int, input().split())
    
    if w == 0 and h == 0:
        break
        
    L = [list(map(int, input().split())) for i in range(h)]
    flag = [[-1 for _ in range(w)] for _ in range(h)]
    res = 0
    q = deque()
    
    for y in range(h):
        for x in range(w):
            if L[y][x] == 1 and flag[y][x] == -1:
                q.append([y, x])
                flag[y][x] = 0
                res += 1
                while q:
                    ny, nx = q.pop()
                    for i, j in [(0,1), (0,-1), (1,0), (-1,0), (1,1), (1, -1), (-1, 1), (-1, -1)]:
                        if 0 <= ny + i < h and 0 <= nx + j < w:
                            if L[ny + i][nx + j] == 1 and flag[ny + i][nx + j] == -1:
                                q.append([ny + i, nx + j])
                                flag[ny + i][nx + j] = 0
                            
    result.append(res)
                            
        
for res in result:
    print(res)

Python: while 1:
    W, H = list(map(int,input().split()))
    if W == 0:break

    C = [list(map(int, input().split())) for i in range(H) ]
    
    def work(x,y):
        ax = [-1, 0, 1, -1, 1, -1, 0, 1]
        ay = [-1, -1, -1, 0, 0, 1, 1, 1]

        if C[y][x] != 1:return False
        stack = [(x,y)]

        while len(stack) > 0:
            s = stack.pop(-1)
            C[s[1]][s[0]] = -1 #mark

            for _x in [s[0] + _x for _x in ax]:
                for _y in [s[1] + _y for _y in ay]:
                    if 0 <= _x < W and 0 <= _y < H and C[_y][_x] == 1:
                        stack.append((_x, _y))
        return True
#    def work(x,y):
#        ax = [-1, 0, 1, -1, 1, -1, 0, 1]
#        ay = [-1, -1, -1, 0, 0, 1, 1, 1]
#
#        if C[y][x] != 1:return False
#        C[y][x] = -1 #mark
#
#        for _ax in ax:
#            for _ay in ay:
#                if 0 <= _ax + x < W and 0 <= _ay + y < H:
#                    work(_ax + x, _ay + y)
#        return True

    cnt = 0
    for x in range(W):
        for y in range(H):
            cnt += work(x,y)
    print(cnt)

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

def dfs(sx,sy):
  stack=[[sx,sy]]
  while(stack):
    x,y=stack.pop()
 
    move=[[x,y],[x,y-1],[x,y+1],[x+1,y],[x-1,y],[x-1,y-1],[x+1,y+1],[x+1,y-1],[x-1,y+1]]
 
    for mx,my in move:
      if not(0<=mx<=h-1) or not(0<=my<=w-1):
        continue

      elif l[mx][my]==1:
        stack.append([mx,my])
        l[mx][my]=0

while(True):
  w,h=[int(x) for x in input().rstrip().split()]
  if w==h==0:
    break

  l=[]
  for i in range(h):
    c=[int(x) for x in input().rstrip().split()]
    l.append(c)
    
  ans=0
  for i in range(h):
    for j in range(w):
      if l[i][j]==1:
        dfs(i,j)
        ans+=1
  print(ans)

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

Python: import sys
sys.setrecursionlimit(100000)

while True:
    w, h = map(int, input().split())
    if w == 0:
        break
    field = [list(map(int, input().split())) for _ in range(h)]
    searched = [[False for _ in range(w)] for __ in range(h)]
    
    islands = 0
    
    def search(x, y):
        if not (0 <= x < w and 0 <= y < h):
            return 0
        if searched[y][x]:
            return 0
        searched[y][x] = True
        if field[y][x] == 0:
            return 0
        
        search(x-1, y-1)
        search(x-1, y)
        search(x-1, y+1)
        search(x, y-1)
        search(x, y+1)
        search(x+1, y-1)
        search(x+1, y)
        search(x+1, y+1)
        
        return 1
        
    for y in range(h):
        for x in range(w):
            if not searched[y][x]:
                islands += search(x, y)
                    
    print(islands)

Python: import sys

sys.setrecursionlimit(10**5)

def solve():
    while 1:
        w, h = map(int, sys.stdin.readline().split())

        if w == h == 0:
            return

        room = [[int(j) for j in sys.stdin.readline().split()] for i in range(h)]

        cnt = 0

        for i in range(h):
            for j in range(w):
                if room[i][j]:
                    cnt += 1
                    dfs(w, h, room, i, j)

        print(cnt)

def dfs(w, h, room, i, j):
    if i < 0 or i >= h or j < 0 or j >= w or (not room[i][j]):
        return

    room[i][j] = 0

    dfs(w, h, room, i + 1, j)
    dfs(w, h, room, i - 1, j)
    dfs(w, h, room, i, j + 1)
    dfs(w, h, room, i, j - 1)
    dfs(w, h, room, i + 1, j + 1)
    dfs(w, h, room, i + 1, j - 1)
    dfs(w, h, room, i - 1, j + 1)
    dfs(w, h, room, i - 1, j - 1)

if __name__ == '__main__':
    solve()

C++: #include <bits/stdc++.h>
using namespace std;
int ans = 1e9;
int H,W;
int mp[50][50];
int nx,ny;
void func(int y,int x){
	//cout << y << ' ' <<x<<endl;
	if(mp[y][x] == 1){
		mp[y][x] = 2;
		func(y,x);
	}
	if(mp[y+1][x] == 1){
		mp[y+1][x] = 2;
		func(y+1,x);
	}
	if(mp[y][x+1] == 1){
		mp[y][x+1] = 2;
		func(y,x+1);
	}
	if(mp[y+1][x+1] == 1){
		mp[y+1][x+1] = 2;
		func(y+1,x+1);
	}
	if(mp[y-1][x] == 1){
		mp[y-1][x] = 2;
		func(y-1,x);
	}
	if(mp[y][x-1] == 1){
		mp[y][x-1] = 2;
		func(y,x-1);
	}
	if(mp[y-1][x-1] == 1){
		mp[y-1][x-1] = 2;
		func(y-1,x-1);
	}
	if(mp[y+1][x-1] == 1){
		mp[y+1][x-1] = 2;
		func(y+1,x-1);
	}
	if(mp[y-1][x+1] == 1){
		mp[y-1][x+1] = 2;
		func(y-1,x+1);
	}
}
void findL(){
	nx = -1;ny = -1;
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if(mp[i][j] == 1){
				nx = j,ny = i;
				//cout <<nx<<ny<<endl;
				i = H; j = W;
			}
		}
	}
}
int main(){
	
	cin >> H>>W;
	while(W!=0){
		for(int i = 0; i < H; i++){
			for(int j = 0; j < W; j++){
				cin >> mp[i][j];
			}
		}
		int c = 0;
		findL();
		while(nx != -1 && ny != -1){
			func(ny,nx);
			c++;
			findL();
		}
		cout << c << endl;
		cin >> W >> H;
	}
	return 0;
}