Go: package main

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

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

C++: #include<iostream>
#include<vector>
#include<stack>
using namespace std;

typedef long long itemType;

struct node
{long long v; struct node *next;};

void visit(stack<long long> stack, long long k, struct node *z, struct node **adj, long long id, long long val[]){
    struct node *t;
    t = new node;
    stack.push(k);
    while(!stack.empty()){
        k = stack.top();
        stack.pop();
        val[k] = ++id;
        for(t = adj[k]; t != z; t = t -> next){
            if(val[t -> v] == 0){
                stack.push(t -> v);
                val[t -> v] = -1;
            }
        }
    }
}

void search(stack<long long>stack, long long V, struct node *z, struct node **adj, long long id, long long val[], long long &comp, vector<vector<bool> > c, long long w){
    long long k;
    for(k = 1; k <= V; k++) val[k] = 0;
    for(k = 1; k <= V; k++){
        if(val[k] == 0){
            if(c[(k-1)/w + 1][((k-1)%w) + 1]) comp++;
            visit(stack, k, z, adj, id, val);
        }
    }
}

int main(){
    long long w, h;
    vector<bool> sub;
    bool c_sub;
    long long i, j;
    for(i = 0; i <= 50; i++){
        sub.push_back(0);
    }
    vector<vector<bool> > c;
    for(i = 0; i <= 50; i++){
        c.push_back(sub);
    }
    long long V;
    struct node *z;
    z = new node;
    z -> next = z;
    struct node *adj[2501];
    struct node *t;
    long long x, y;
    while(1){

        //input
        cin >> w >> h;
        if(w == 0 && h == 0) break;
        for(i = 1; i <= h; i++){
            for(j = 1; j <= w; j++){
                cin >> c_sub;
                c[i][j] = c_sub;
            }
        }

        //adjacency list representation
        V = w * h;
        stack<long long> stack;
        for(i = 1; i <= V; i++){
            adj[i] = z;
        }
        for(j = 1; j <= w; j++){
            for(i = 1; i <= h-1; i++){
                if(c[i][j] & c[i+1][j]){
                    x = (i-1)*w + j;
                    y = i*w + j;
                    t = new node;
                    t -> v = x;
                    t -> next = adj[y];
                    adj[y] = t;
                    t = new node;
                    t -> v = y;
                    t -> next = adj[x];
                    adj[x] = t;
                    
                }
            }
        }
        
        for(i = 1; i <= h; i++){
            for(j = 1; j <= w-1; j++){
                if(c[i][j] & c[i][j+1]){
                    x = (i-1)*w + j;
                    y = (i-1)*w + j+1;
                    t = new node;
                    t -> v = x;
                    t -> next = adj[y];
                    adj[y] = t;
                    t = new node;
                    t -> v = y;
                    t -> next = adj[x];
                    adj[x] = t;
                    
                }
            }
        }
        for(i = 1; i <= h-1; i++){
            for(j = 1; j <= w-1; j++){
                if(c[i][j] & c[i+1][j+1]){
                    x = (i-1)*w + j;
                    y = i*w + j+1;
                    t = new node;
                    t -> v = x;
                    t -> next = adj[y];
                    adj[y] = t;
                    t = new node;
                    t -> v = y;
                    t -> next = adj[x];
                    adj[x] = t;
                    
                }
            }
        }
        for(i = 1; i <= h-1; i++){
            for(j = 1; j <= w-1; j++){
                if(c[i+1][j] & c[i][j+1]){
                    x = i*w + j;
                    y = (i-1)*w + j+1;
                    t = new node;
                    t -> v = x;
                    t -> next = adj[y];
                    adj[y] = t;
                    t = new node;
                    t -> v = y;
                    t -> next = adj[x];
                    adj[x] = t;
                    
                }
            }
        }

        //depth first search
        long long id = 0;
        long long val[V + 1];
        long long comp = 0;
        search(stack, V, z, adj, id, val, comp, c, w);
        cout << comp << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int c[50][50];

int dx[8] = {-1,-1,-1, 0, 0, 1, 1, 1};
int dy[8] = {-1, 0, 1,-1, 1,-1, 0, 1};

int ret;

int w,h;

void dfs(int x,int y){
	if(c[x][y] == 0) return;
	c[x][y] = 0;
	for(int i=0;i<8;i++){
		if(x+dx[i] < 0 || x+dx[i] >= w) continue;
		if(y+dy[i] < 0 || y+dy[i] >= h) continue;
		dfs(x+dx[i],y+dy[i]);
	}
}

int main(){
	while(cin >> w >> h,w){
		ret = 0;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				cin >> c[j][i];
			}
		}
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(c[i][j] == 1){
					ret++;
					dfs(j,i);
				}
			}
		}
		cout << ret << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>

using namespace std;

#define vec vector
#define rep(i, n) for (int i = 0; i < (int)n; i++)

int dx[8] = {0, 0, 1, 1, 1,-1,-1,-1};
int dy[8] = {1,-1,-1, 0, 1,-1, 0, 1};

int dp[55][55];
int c[55][55];

int check(int x, int y)
{
	if (dp[x][y]) return 0;
	if (c[x][y] == 0) return 0;
	dp[x][y] = 1;
	
	rep(i, 8) {
		int xx = x + dx[i];
		int yy = y + dy[i];
		int take = check(xx, yy);
	}
	return 1;
}

int main(void)
{
	while(1) {
		int w, h;
		cin >> w >> h;
		if (w == 0) break;
		rep(i, 55) rep(j, 55) c[i + 1][j + 1] = 0;
		rep(i, h) rep (j, w) cin >> c[i + 1][j + 1];
		rep(i, 55) rep(j, 55) dp[i][j] = 0;
		rep(i, 55) {
			dp[0][i] = 1;
			dp[i][0] = 1;
			dp[h + 1][i] = 1;
			dp[i][w + 1] = 1;
		}

		int ans = 0;
		rep(i, h) rep(j, w) if (c[i + 1][j + 1]) ans += check(i + 1, j + 1);
		cout << ans << endl;
	}
	return 0;
}