Go: package main

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

var (
	readString func() string
	readBytes  func() []byte
	stdout     *bufio.Writer
)

func init() {
	readString, readBytes = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) (func() string, func() []byte) {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), math.MaxInt32)
	r.Split(bufio.ScanWords)

	f1 := func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
	f2 := func() []byte {
		return []byte(f1())
	}
	return f1, f2
}

func readInt() int {
	return int(readInt64())
}

func readInt64() int64 {
	i, err := strconv.ParseInt(readString(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(readString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(stdout, f, args...)
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdout, args...)
}

func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func min64(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func max64(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func abs64(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func gcd64(a, b int64) int64 {
	if b == 0 {
		return a
	}
	return gcd64(b, a%b)
}

// readString() string
// readInt() int
// readInt64() int64
// readFloat64() float64

// -----------------------------------------------------------------------------

func main() {
	defer stdout.Flush()

	for {
		ans, ok := solve()
		if !ok {
			break
		}
		println(ans)
	}

}

func solve() (int, bool) {
	w := readInt()
	h := readInt()
	if w == 0 && h == 0 {
		return 0, false
	}

	c := make([][]int, h+2)
	c[0] = make([]int, w+2)
	c[h+1] = make([]int, w+2)
	for i := 1; i-1 < h; i++ {
		c[i] = make([]int, w+2)
		for j := 1; j-1 < w; j++ {
			c[i][j] = readInt()
		}
	}

	var ans int
	for i := 1; i-1 < h; i++ {
		for j := 1; j-1 < w; j++ {
			if 0 < c[i][j] {
				ans++
				dfs(c, i, j)
			}
		}
	}
	return ans, true
}

func dfs(c [][]int, y, x int) {
	c[y][x] = 0
	dx := []int{-1, 0, 1, -1, 1, -1, 0, 1}
	dy := []int{-1, -1, -1, 0, 0, 1, 1, 1}
	for i := range dx {
		nx := x + dx[i]
		ny := y + dy[i]
		if 0 < c[ny][nx] {
			dfs(c, ny, nx)
		}
	}
}

// -----------------------------------------------------------------------------

C++: #include <iostream>
#include <vector>
#include <string>

using namespace std;

void search(int w, int h, const vector< vector<int> >& area_map, vector< vector<int> >& visited, int W, int H) {
    visited[h][w] = 1;
    int dw[] = {1, 1, 0, -1, -1, -1, 0, 1}, dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
    for(int i = 0; i < 8; i++) {
        int nw = w + dw[i], nh = h + dh[i];
        if(0 <= nw && nw < W && 0 <= nh && nh < H && visited[nh][nw] != 1 && area_map[nh][nw] == 1) {
            search(nw, nh, area_map, visited, W, H);
        }
    }
}

int main() {
    while(true) {
        int w, h; 
        cin >> w >> h;
        if(w == 0 && h == 0) break;

        vector< vector<int> > area_map, visited;
        for(int i = 0; i < h; i++) {
            vector<int> temp;
            for(int j = 0; j < w; j++) {
                int e; cin >> e;
                temp.push_back(e);
            }
            area_map.push_back(temp);
            visited.push_back(vector<int>(w));
        }
        int ans = 0;
        for(int i = 0; i < h; i++) {
            for(int j = 0; j < w; j++) {
                if(area_map[i][j] == 1 && visited[i][j] != 1) {
                    search(j, i, area_map, visited, w, h);
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }
}

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

int h,w;

int v[50][50];

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

void calc(int y,int x){
	if(v[y][x]==0) return;
	v[y][x]=0;
	for(int r=0;r<8;r++){
		int nx=x+dx[r],ny=y+dy[r];
		if(nx<0 || ny<0 || nx>=w || ny>=h)
			continue;
		calc(ny,nx);
	}
}


void solve()
{
	memset(v,0,sizeof(v));
	for(int y=0;y<h;y++){
		for(int x=0;x<w;x++){
			int t;cin>>t;v[y][x]=t;
		}
	}
	int res=0;

	for(int y=0;y<h;y++)
		for(int x=0;x<w;x++){
			if(v[y][x]==0) continue;
			res++;
			calc(y,x);
		}
		cout<<res<<endl;
}



int main()
{
	while(cin>>w>>h){
		if(w==0) break;
		solve();
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <complex>
#include <iomanip>
using namespace std;
//using ll = long long;
#define MM 1000000000
#define MOD MM+7
#define pi pair<int32,int32>
#define pl pair<int64,int64>
#define chmax(a,b) (a<b ? a=b:0)
#define chmin(a,b) (a>b ? a=b:0)
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1,0,1,0,-1,-1,1,1};
int dy[8] = {0,-1,0,1,-1,1,1,-1};
template<typename T>
T GCD(T u,T v){
    return v ? GCD(v,u%v) : u;
}
int c[50][50];
int visited[50][50];
void init(int h,int w){
    for(int i = 0; i < 50; i++){
        for(int j = 0; j < 50; j++){
            visited[i][j] = false;
            c[i][j] = 0;
        }
    }
}
void dfs(int h,int w,int H,int W){
    visited[h][w] = true;
    for(int i = 0; i < 8; i++){
        int ny = h+dy[i];
        int nx = w+dx[i];
        if (0 <= ny && ny < H && 0 <= nx && nx < W && visited[ny][nx] == false && c[ny][nx] == 1){
            dfs(ny,nx,H,W);
        }
    }
    return;
}
int main(){
    vector<int> ans(0);
    for(;;){
        int H,W; cin >> W >> H;
        if(H == 0 && W == 0) break;
        init(H,W);
        for(int h = 0; h < H; h++){
            for(int w = 0; w < W; w++){
                cin >> c[h][w];
            }
        }
        int cnt = 0;
        for(int h = 0; h < H; h++){
            for(int w = 0; w < W; w++){
                if (c[h][w] == 1 && visited[h][w] == false){
                    dfs(h,w,H,W);
                    cnt++;
                }
            }
        }
        /* 
        for(int i = 0; i < H; i++){
            for(int j = 0; j < W; j++){
                cout << visited[i][j] << " ";
            }
            cout << endl;
        }
        */
        ans.push_back(cnt);
    }
    for(int i = 0; i < ans.size(); i++){
        cout << ans[i] << endl;
    }
}