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<bits/stdc++.h>
using namespace std;
typedef long long int ll;

int W,H;
vector<vector<int> > c;

void dfs(int h, int w){
    c[h][w] = 0;

    for(int i=-1;i<=1;++i){
        for(int j=-1;j<=1;++j){
            int nh = h + i, nw = w + j;

            if(nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
            if(c[nh][nw] == 0) continue;

            dfs(nh, nw);
        }
    }
}

int main(){
    while(cin >> W >> H){
        if(H == 0 || W == 0) break;
        c.assign(H, vector<int>(W, 0));
        for(int i=0;i<H;++i){
            for(int j=0;j<W;++j){
                cin >> c[i][j];
            }
        }

        int count = 0;
        for(int i=0;i<H;++i){
            for(int j=0;j<W;++j){
                if(c[i][j] == 0) continue;
                dfs(i, j);
                count ++;
            }
        }
        cout << count << endl;
    }
}

C++: #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;

int w, h;
int c[51][51];
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};

void dfs(int y, int x){
	c[y][x] = 0;
	for(int i = 0; i < 8; i++){
		int ny = y + dy[i], nx = x + dx[i];
		if(0<=ny and ny<h and 0<=nx and nx<w and c[ny][nx]==1){
			dfs(ny, nx);
		}
	}
}

int solve(){
	int res = 0;
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			if(c[i][j] == 1){
				dfs(i, j);
				res++;
			}
		}
	}

	return res;
}

int main(void){
	while(scanf("%d%d", &w, &h) != EOF){
		if(w == 0 and h == 0) break;
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				scanf("%d", &(c[i][j]));
			}
		}
		printf("%d\n", solve());
	}

	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<queue>

typedef std::pair<int, int> P;
int vx[] = { 0, 1, 0, -1, 1, 1, -1, -1 }, vy[] = { 1, 0, -1, 0, 1, -1, 1, -1 };
int w, h;
int map[51][51];

void bfs(int x, int y){

	map[y][x] = 0;

	std::queue<P>que;
	que.push(P(x, y));

	while (!que.empty()){

		P p = que.front();
		que.pop();

		for (int i = 0; i < 8; i++){
			int nx = p.first + vx[i], ny = p.second + vy[i];

			if (0 <= nx&&nx < w && 0 <= ny&&ny < h&&map[ny][nx] != 0){
				map[ny][nx] = 0;
				que.push(P(nx, ny));
			}
		}
	}

	return;
}

int main(){

	while (std::cin >> w >> h, w || h){

		int cnt = 0;

		memset(map, 0, sizeof(map));
	
		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				std::cin >> map[i][j];
			}
		}

		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				if (map[i][j] != 0){
					bfs(j, i);
					cnt++;
				}
			}
		}

		std::cout << cnt << std::endl;
	}

	return 0;
}

C++: #include <iostream>
using namespace std;
int w, h;
int c[55][55];

void dfs(int y, int x) {
    c[y][x] = 0;
    for (int dh = -1; dh <= 1; dh++) {
        for (int dw = -1; dw <= 1; dw++) {
            int nh = y + dh, nw = x + dw;
            if (0 <= nh && 0 <= nw && nh < h && nw < w && c[nh][nw]) {
                dfs(nh, nw);
            }
        }
    }
}

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

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

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

int fill(vector<vector<bool> >& map, int y, int x){
    if(!map[y][x]) return 0;
    map[y][x] = false;
    for(int i=0; i<8; i++){
        fill(map, y+dy[i], x+dx[i]);
    }
    return 1;
}
        
int main(){
    while(1){
        int w,h;
        cin >> w >> h;
        if(w==0) break;

        vector<vector<bool> > map(h+2, vector<bool>(w+2, false));
        for(int i=1; i<=h; i++){
            for(int j=1; j<=w; j++){
                int tmp;
                cin >> tmp;
                if(tmp==1) map[i][j]=true;
            }
        }

        int count=0;
        for(int i=1; i<=h; i++){
            for(int j=1; j<=w; j++){
                count+= fill(map, i,j);
            }
        }
        cout << count << endl;
    }   
    return 0;
}

C++: //
//AOJ vol11-1160
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1160&lang=jp
//20170616
//640009E
//Yang Bo
//

#include <iostream>

using namespace std;

int a[50][50];
int h, w;

int recursion(int y, int x)
{
  int number = 1;
  a[y][x] = 0;

  if (x < w - 1)
    if (a[y][x + 1] == 1)
      number = recursion(y, x + 1);
  if (y < h - 1)
    if (a[y + 1][x] == 1)
      number = recursion(y + 1, x);
  if (x > 0)
    if (a[y][x - 1] == 1)
      number = recursion(y, x - 1);
  if (y > 0)
    if (a[y - 1][x] == 1)
      number = recursion(y - 1, x);
  if (y < h - 1 && x < w - 1)
    if (a[y + 1][x + 1] == 1)
      number = recursion(y + 1, x + 1);
  if (y < h - 1 && x > 0)
    if (a[y + 1][x - 1] == 1)
      number = recursion(y + 1, x - 1);
  if (y > 0 && x < w - 1)
    if (a[y - 1][x + 1] == 1)
      number = recursion(y - 1, x + 1);
  if (y > 0 && x > 0)
    if (a[y - 1][x - 1] == 1)
      number = recursion(y - 1, x - 1);
  

  //cout << "recursion(" << y << ", "<< x << ") = " << number << endl;
  return number;
}

int main()
{
  while (cin >> w >> h) {
    if (w == 0)
      break;
    else {
      for (int i = 0; i < h; i++) {
	for (int j = 0; j < w; j++) {
	  cin >> a[i][j]; //??\???
	}
      }
      int ans = 0;
      for (int i = 0; i < h; i++) {
	for (int j = 0; j < w; j++) {
	  if (a[i][j] == 1) {
	    //cout << "i = " << i << " ,j = " << j << endl;
            ans += recursion(i, j);
	  }
	}
      }
      cout << ans << endl;
    }
  }
}

/*
??¢?????´??????????????????????????????????????????????´°?????????????°???\?????????????£???????????????£???????????£??????
*/