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>
using namespace std;
#define MAX 50

int c[MAX][MAX];

void dfs(int w, int h, int x, int y);
int main(int argc, char const *argv[]){
    int w, h, ans;

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

void dfs(int w, int h, int x, int y){
    int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
    int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
    c[y][x] = 0;

    for (int i = 0; i < 8; i++){
        int nx = x + dx[i];
        int ny = y + dy[i];

        if (0 <= nx && nx < w && 0 <= ny && ny < h && c[ny][nx] == 1){
            dfs(w, h, nx, ny);
        }
    }
    return;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<bitset>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
using namespace std;

void erase_island (int ocean[][50], int h, int w, int i, int j) {
    ocean[i][j] = 0;
    for(int dy = -1; dy <= 1; dy++) {
        for(int dx = -1; dx <= 1; dx++) {
            if (i + dy >= 0 && i + dy < h && j + dx >= 0 && j + dx < w) {
                if(ocean[i+dy][j+dx] == 1)  erase_island(ocean, h, w, i+dy, j+dx);
            }
        }
    }
}

int main() {

    int w, h;
    while(cin >> w >> h && (w || h)) {
        int ocean[h][50];
        for(int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                cin >> ocean[i][j];
            }
        }
        int answer = 0;
        for(int i = 0; i < h; i++) {
            for(int j = 0; j < w; j++) {
                if (ocean[i][j] == 1) {
                    erase_island(ocean, h, w, i, j);
                    answer += 1;
                }
            }
        }
        cout << answer << endl;
    }
     
    return 0;
}

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

using namespace std;

int tizu[52][52];

void check(int i, int j) {
	tizu[i][j] = 0;
	for (int k = -1; k <= 1; k++) {
		for (int l = -1; l <= 1; l++) {
			if (tizu[i+k][j+l] == 1) {
				check(i+k,j+l);
			}
		}
	}
	return;
}

int main() {
	int w, h;
	while (cin >> w >> h) {
		if (w == 0 && h == 0) {
			break;
		}
		for (int i = 0; i < 52; i++) {
			for (int j = 0; j < 52; j++) {
				tizu[i][j] = 0;
			}
		}
		int counter = 0;
		for (int i = 1; i <= h; i++) {
			for (int j = 1; j <= w; j++) {
				cin >> tizu[i][j];
			}
		}
		for (int i = 1; i <= h; i++) {
			for (int j = 1; j <= w; j++) {
				if (tizu[i][j] == 1) {
					counter++;
					check(i,j);
				}
			}
		}
		cout << counter << endl;
	}
	return 0;
}

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

// 入力
int H, W;
vector<vector<int> > field;

// 探索
void dfs(int h, int w) {
    field[h][w] = 0;

    // 八方向を探索
    for (int dh = -1; dh <= 1; ++dh) {
        for (int dw = -1; dw <= 1; ++dw) {
            int nh = h + dh, nw = w + dw;
            
            // 場外アウトしたり、0 だったりはスルー
            if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
            if (field[nh][nw] == 0) continue;

            // 再帰的に探索
            dfs(nh, nw);
        }
    }
}

int main() {
    // 入力受け取り
    while (cin >> W >> H) {
        if (H == 0 || W == 0) break;
        field.assign(H, vector<int>(W, 0));
        for (int h = 0; h < H; ++h) for (int w = 0; w < W; ++w) cin >> field[h][w];

        // 探索開始
        int count = 0;
        for (int h = 0; h < H; ++h) {
            for (int w = 0; w < W; ++w) {
                if (field[h][w] == 0) continue; // 残島じゃなかったらスルー
                dfs(h, w);
                ++count;
            }
        }
        cout << count << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;

ll field[60][60];
bool f[60][60];
ll W, H;

void dfs(ll h, ll w)
{
	if (f[h][w]) return;
	f[h][w] = true;
	for (ll i = -1; i <= 1; ++i)
		for (ll j = -1; j <= 1; ++j)
		{
			ll nw = w + i;
			ll nh = h + j;
			if (nw < 0 || nw > W || nh < 0 || nh > H) continue;
			if (field[nh][nw])
				dfs(nh, nw);
		}
}

int main(int argc, char **argv)
{
	while (cin >> W >> H, true)
	{
		if (W == 0 && H == 0) break;
		memset(f, 0, sizeof f);
		memset(field, 0, sizeof field);

		vector<pair<ll, ll>> search;
		search.reserve(50*50);
		for (ll h = 0; h < H; ++h)
			for (ll w = 0; w < W; ++w)
			{
				cin >> field[h][w];
				if (field[h][w] == 1)
				{
					search.push_back(pair<ll, ll>(h, w));
					// std::cout << "(h, w) : " << h << ", " << w << std::endl;
				}
			}
		
		ll res{0};
		for (ll i = 0; i < (ll)search.size(); ++i)
		{
			if (!f[search[i].first][search[i].second])
			{
				// std::cout << "(h, w) : " << search[i].first << ", " << search[i].second << std::endl;
				dfs(search[i].first, search[i].second);
				++res;
			}
		}
		std::cout << res << std::endl;

	}
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
bool seen[50][50];
int G[50][50];

void dfs(int x,int y,int h,int w){
    seen[x][y]=true;

    rep(i,8){
        int nx=x+dx[i];
        int ny=y+dy[i];
        if(nx<0||nx>h-1||ny<0||ny>w-1)continue;
        if(seen[nx][ny])continue;
        if(G[nx][ny]==0)continue;
        dfs(nx,ny,h,w);
    }
}

int main(){
    while(1){
        int h,w;
        int ans=0;
        cin>>w>>h;
        if(w==0&&h==0)break;
        rep(i,h)rep(j,w)cin>>G[i][j];
        rep(i,50)rep(j,50)seen[i][j]=false;
        rep(i,h)rep(j,w){
            if(seen[i][j]==false&&G[i][j]==1){
                ans++;
                dfs(i,j,h,w);
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}