Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

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

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

const int MAXW = 52;

bool tile[MAXW][MAXW];

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

int solve(int x, int y)
{
    if(!tile[x][y]) return 0;
    tile[x][y] = false;
    REP(8)
        solve(x + dx[i], y + dy[i]);
    return 1;
}
int w,h;
int main()
{
    while(cin >> w >> h && w)
    {
        memset(tile, false, sizeof(tile));

        rep(j,h)rep(i,w) cin >> tile[i+1][j+1] ;

        int ans = 0;
        rep(j,h)rep(i,w)ans += solve(i+1, j+1);
        cout << ans << endl;

    }

    return 0;
}

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 <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <numeric>
#include <string>
#include <bitset>
#include <functional>

using ld = long double;
using vld = std::vector<ld>;
using vvld = std::vector<vld>;
using vvvld = std::vector<vvld>;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using pll = std::pair<ll, ll>;
using vpll = std::vector<pll>;
using str = std::string;
using vstr = std::vector<str>;

template<typename T> bool chmin(T a, T &b) { return a < b ? b = a, true : false; }
template<typename T> bool chmax(T a, T &b) { return a > b ? b = a, true : false; }

constexpr ld PI = 3.141592653589793L;
constexpr ld EPS = std::numeric_limits<ld>::epsilon();

ll gcd(ll n, ll m) { return m ? gcd(m, n % m) : n; }
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
bool is_prime(ll n) {
    if (n == 1) return false;
    for (ll i = 2; i * i <= n; i++)
        if (n % i == 0) return false;
    return true;
}

/*------------------------------------------------------------------------*/

void solve();

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::setprecision(15);

    solve();
}
void solve() {
    const vll dy = { -1, -1, -1, 0, 1, 1, 1, 0 }, dx = { -1, 0, 1, 1, 1, 0, -1, -1 };

    while (true) {
        ll w, h; std::cin >> w >> h;

        if (w == 0 && h == 0) break;

        vvll g(h, vll(w));
        for (ll i = 0; i < h; i++) for (ll j = 0; j < w; j++)
            std::cin >> g[i][j];

        vvll flg(h, vll(w, 0));

        auto bfs = [&](ll sy, ll sx) -> void {
            flg[sy][sx]++;
            std::queue<pll> que; que.push({ sy, sx });

            while (!que.empty()) {
                pll p = que.front(); que.pop();
                ll cy = p.first, cx = p.second;
                for (ll i = 0; i < 8; i++) {
                    ll ny = cy + dy[i], nx = cx + dx[i];
                    if (0 <= ny && ny < h && 0 <= nx && nx < w
                        && g[ny][nx] && !flg[ny][nx]) {
                        flg[ny][nx]++;
                        que.push({ ny, nx });
                    }
                }
            }
        };

        ll ans = 0;
        for (ll i = 0; i < h; i++) for (ll j = 0; j < w; j++)
            if (g[i][j] && !flg[i][j]) {
                ans++; bfs(i, j);
            }

        std::cout << ans << '\n';
    }
}

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

int w,h;
int field[51][51];

// 現在地(x,y)
void dfs(int x, int y){
    // 今いるところを-1に置き換える
    field[y][x] = -1;

    // 移動する8方向をループ
    for(int dx = -1 ; dx <= 1 ; dx++ ){
        for(int dy = -1 ; dy <= 1 ; dy++ ){
            // x方向にdx, y方向にdy, 移動した場所を(mx,my)とする
            int mx = x + dx;
            int my = y + dy;
            // 範囲外に出たときは次の処理へ
            if( mx < 0 || my < 0 || mx >= w || my >= h ) continue;
            // 陸地だったら再帰呼び出し
            if( field[my][mx] == 1 ){
                dfs( mx , my );
            }
        }
    }
}

int main(){
    while( cin >> w >> h , w||h ){
        for(int y=0 ; y < h ; y++ ){
            for(int x=0 ; x < w ; x++ ){
                cin >> field[y][x];
            }
        }

        int ans = 0;
        for(int y=0 ; y < h ; y++ ){
            for(int x=0 ; x < w ; x++ ){
                if( field[y][x] == 1 ){ // 陸地があったら再帰関数を呼び出す
                    dfs( x , y );
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
}