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 <queue>
#include <utility>
using namespace std;
typedef pair<int, int> P;

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

int main()
{
    while(true){
        int w, h;
        cin >> w >> h;
        if(w == 0 && h == 0) break;
        int c[53][53];
        for(int j = 0; j < w + 2; j++){
            c[0][j] = c[h + 1][j] = 0;
        }
        for(int i = 1; i <= h; i++){
            c[i][0] = c[i][w + 1] = 0;
            for(int j = 1; j <= w; j++) cin >> c[i][j];
        }
        queue<P> que;
        int ans = 0;
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                if(c[i][j] == 1){
                    c[i][j] = 0;
                    que.push(P(i, j));
                    while(que.size()){
                        int x = que.front().first;
                        int y = que.front().second;
                        que.pop();
                        for(int k = x - 1; k <= x + 1; k++){
                            for(int l = y - 1; l <= y + 1; l++){
                                if(c[k][l] == 1){
                                    c[k][l] = 0;
                                    que.push(P(k, l));
                                }
                            }
                        }
                    }
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
}

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

int w, h, c, n;
int a[50][50];
queue<int> q;

void bfs() {
	int x, y;
	while (1) {
		x = q.front() % w;
		y = q.front() / w;
		if ( x > 0 && a[y][x - 1] == 1 ) {
			a[y][x - 1] = 0;
			q.push( y * w + x - 1 );
		}
		if ( y > 0 && a[y - 1][x] == 1 ) {
			a[y - 1][x] = 0;
			q.push( ( y - 1 ) * w + x );
		}
		if ( x < w - 1 && a[y][x + 1] == 1 ) {
			a[y][x + 1] = 0;
				q.push( y * w + x + 1 );
		}
		if ( y < h - 1 && a[y + 1][x] == 1 ) {
			a[y + 1][x] = 0;
			q.push( ( y + 1 ) * w + x );
		}
		q.pop();
		if ( q.empty() ) break;	
	}
	n++;
}

int main() {

	while (1) {
		n = 0;
		for ( int j = 0; j < 50; j++ )
			for ( int i = 0; i < 50; i++ )
				a[j][i] = 0;
		cin >> w >> h;
		if ( w == 0 ) break;
		for ( int j = 0; j < h; j++ ) {
			for ( int i = 0; i < w; i++ ) {
				cin >> c;
				a[j][i] = c;
			}
		}
		for ( int j = 0; j < h; j++ ) {
			for ( int i = 0; i < w; i++ ) {
				if ( a[j][i] == 1 ) {
					a[j][i] = 0;
					q.push( j * w + i );
					bfs();
				}
			}
		}
		cout << n << endl;
	}
}

C++: #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
const int INF = 2147483647;
const ll MOD = 1000000007;

using namespace std;

void dfs(const int i, const int j, const int h, const int w, const vector<vi> &grid, vector<vector<bool>> &visited) {
  if (not(0 <= i and i < h and 0 <= j and j < w))
    return;
  if (visited[i][j] or grid[i][j] == 0)
    return;
  visited[i][j] = true;
  int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
  int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
  REP(k, 8) { dfs(i + dx[k], j + dy[k], h, w, grid, visited); }
}

int main() {
  while (true) {
    int w, h;
    cin >> w >> h;
    if (w == 0 and h == 0)
      return 0;
    vector<vi> grid(h, vi(w, 0));
    vector<vector<bool>> visited(h, vector<bool>(w, false));
    REP(i, h) {
      REP(j, w) { cin >> grid[i][j]; }
    }

    int ans = 0;
    REP(i, h) {
      REP(j, w) {
        if (not visited[i][j] and grid[i][j] == 1) {
          ans++;
          dfs(i, j, h, w, grid, visited);
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}