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<bits/stdc++.h>

using namespace std;
using ll = long long;

int w, h;
vector<vector<bool>> mp;


vector<pair<int,int>> dir{{0,1},{1,0},{-1,0},{0,-1},{1,1},{-1,-1},{1,-1},{-1,1}};

void dfs(int y, int x)
{
    for(auto i : dir){
        if(mp[y + i.first][x + i.second]){
            mp[y + i.first][x + i.second] = false;
            dfs(y + i.first, x + i.second);
        }
    }
}


int main()
{
    vector<int> AS;
    while(1){
        cin >> w >> h;
        if(!w && !h)break;
        mp.resize(h + 2,vector<bool>(w + 2));
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                int t; cin >> t;
                mp[i][j] = t;
            }
        }

        int ans = 0;
        for(int i = 1; i <= h; i++){
            for(int j = 1; j <= w; j++){
                if(mp[i][j]){
                    mp[i][j] = false;
                    dfs(i, j);
                    ans++;
                }
            }
        }
        AS.push_back(ans);
    }
    for(auto i : AS)cout << i << endl;
}

C++: #include<cmath>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstdio>
#include<map>
#include<utility>
#include<list>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fori(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int dX[8] = { 0, 1, 1, 1, 0, -1, -1, -1 }, dY[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };
struct XY
{
	int x;
	int y;
};


/*
(char)'1' - (int)48 = (int)1;


*/
int main()
{
	int h, w;
	cin >> w>> h;
	while (w != 0 || h != 0)
	{
		queue<XY> m;
		int a[200][200] = {};
		for (int i = 0; i < h; i++)
		{
			for (int l = 0; l < w; l++)
			{
				cin >> a[i + 1][l + 1];
			}
		}


		int ans = 0;

		for (int i = 0; i <= h; i++)
		{
			for (int l = 0; l <= w; l++)
			{
				if (a[i][l] == 1)
				{
					ans++;
					XY now;
					now.x = l;
					now.y = i;
					m.push(now);
					while (!m.empty())
					{
						XY gg;
						int x, y;
						x = m.front().x;
						y = m.front().y;
						m.pop();

						for (int i = 0; i < 8; i++)
						{
							if (a[y + dY[i]][x + dX[i]] == 1)
							{
								a[y + dY[i]][x + dX[i]] = 0;
								gg.x = x + dX[i];
								gg.y = y + dY[i];
								m.push(gg);
							}
						}

					}
				}
			}
		}
		cout << ans << endl;
		cin >> w >> h;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int w, h;
int dy[8]={0,1,1,1,0,-1,-1,-1}, dx[8]={-1,-1,0,1,1,1,0,-1};
char sea[50][50];

void f(int x, int y){
	sea[x][y] = '0';
	for(int i = 0;i < 8;i++){
		int nx = x + dx[i], ny = y + dy[i];
		if(nx>=0 and nx<h and ny>=0 and ny<w and sea[nx][ny]=='1'){
			// cout << nx << " " << ny << endl;
			f(nx, ny);
		}
	}
	return;
}

int main(){
	while(1){
		cin >> w >> h;
		if(w == 0 and h == 0) break;
		for(int i = 0;i < h;++i){
			for(int j = 0;j < w;++j) cin >> sea[i][j];
		}

		int ans = 0;

		for(int i = 0;i < h;++i){
			for(int j = 0;j < w;++j){
				if(sea[i][j] == '1'){
					// cout << i << j << endl;
					ans++;
					f(i, j);
				}
			}
		}

		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

int m[50][50]={};
int w,h;
int cnt;

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

void fanc(int y,int x){
	m[y][x]=0;
	int ny,nx;
	for(int i=0;i<8;i++){
		ny = y+dy[i];
		nx = x+dx[i];
		if(ny>=0&&nx>=0&&ny<h&&nx<w&&m[ny][nx]==1){
			fanc(ny,nx);
		}
	}
}

int main(){
	
	
	while(1){
		
		cnt=0;
		cin >> w >> h;
		if(w==0) break;
		
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				cin >> m[i][j];
			}
		}
		
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(m[i][j]!=0){
					cnt++;
					fanc(i,j);
				}
			}
		}
		cout << cnt << endl;
	}
	return 0;
}

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

struct Point {
	int x,y;
};

bool map[50][50];
const int dx[8] = {1,1,0,-1,-1,-1,0,1};
const int dy[8] = {0,1,1,1,0,-1,-1,-1};
int w,h;

void bfs(int x,int y) {

	queue<Point> q;
	Point p,p2;
	p.x = x;
	p.y = y;

	q.push(p);
	map[p.x][p.y] = false;
	while(!q.empty()) {
		p = q.front();
		q.pop();

		for(int i = 0;i < 8;i++) {
			p2.x = p.x + dx[i];
			p2.y = p.y + dy[i];

			if(p2.x < 0 || p2.x >= w) continue;
			if(p2.y < 0 || p2.y >= h) continue;

			if(map[p2.x][p2.y]) {
				q.push(p2);
				map[p2.x][p2.y] = false;
			}
		}
	}
}

int main() {

	while(cin >> w >> h && !(w == 0 && h == 0)) {
		for(int y = 0;y < h;y++) {
			for(int x = 0;x < w;x++) cin >> map[x][y];
		}
		int ct = 0;
		for(int y = 0;y < h;y++) {
			for(int x = 0;x < w;x++) {
				if(map[x][y]) {
					ct++;
					bfs(x,y);
				}
			}
		}
		cout << ct << endl;
	}

}