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<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;

struct TWO{
    long long int a,b;
};

bool cmp(TWO x,TWO y){
    if(x.a!=y.a){
        return x.a<y.a;
    }else{
        return x.b<y.b;
    }
}

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

void dfs(int y, int x) {
    if (f[y][x] == 0) return;
    f[y][x] = 0;
    int dx[3] = {-1, 0, 1};
    int dy[3] = {-1, 0, 1};
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            int nx = x + dx[i];
            int ny = y + dy[j];
            if (nx < 0 || nx == w || ny < 0 || ny == h) continue;
            if (f[ny][nx] == 1) {
                dfs(ny, nx);
            }
        }
    }
}

int main() {
    const long long int mod = 1000000007,INF=50000000000000;
    typedef pair<long long int,long long int>P;
	map<long long int, long long int>mp;
    priority_queue<P,vector<P>,greater<P> >mazuisushi;
    
    priority_queue<P>umaisushi;
	cout << fixed << setprecision(10);
    string str;
    long long int y,m,d;

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

C++: #include <iostream>
 
using namespace std;
 
int W, H;
int field[55][55];
 
void input(void){
    cin >> W;
    cin >> H;
 
    for(int i = 0;i < H;i++){
        for(int j = 0;j < W;j++){
            cin >> field[j][i];
        }
    }
}
 
void dfs(int x, int y){
    field[x][y] = 0;
 
    for(int dx = -1;dx <= 1;dx++){
        for(int dy = -1;dy <= 1;dy++){
            int nx = x + dx, ny = y + dy;
            if(0 <= nx && nx < W && 0 <= ny && ny < H && field[nx][ny] == 1) dfs(nx, ny);
        }
    }
 
    return ;
}
 
int main(){
    while(1){
        int res = 0;
        input();
        if(W == 0 && H == 0) break;
 
        for(int i = 0;i < H;i++){
            for(int j = 0;j < W;j++){
                if(field[j][i] == 1){
                    dfs(j, i);
                    res++;
                }
            }
        }
 
        cout << res << endl;
    }
 
    return 0;
}

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

int h, w;
vector<vector<int> > field, visited;
bool out_field(int i, int j) { return i < 0 || i >= h || j < 0 || j >= w; }

void dfs(int i, int j) {
    if (i < 0 || i >= h || j < 0 || j >= w) return;
    if (visited[i][j] == true) return;
    visited[i][j] = true;
    if (field[i][j] == 0) return;
    for (int di = -1; di < 2; di++) {
        for (int dj = -1; dj < 2; dj++) {
            int ni = i + di, nj = j + dj;
            dfs(ni, nj);
        }
    }
}

int main() {
    while (cin >> w >> h) {
        if (w == 0) break;
        field.assign(h, vector<int>(w));
        visited.assign(h, vector<int>(w));
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                cin >> field[i][j];
            }
        }
        int cnt = 0;
        for (int si = 0; si < h; si++) {
            for (int sj = 0; sj < w; sj++) {
                if (field[si][sj] == 1 && visited[si][sj] != 1) {
                    dfs(si, sj);
                    cnt++;
                }
            }
        }
        cout << cnt << endl;
    }
    return 0;
}

C++: #include <iostream>

#define W_MAX 52
#define H_MAX 52

void dfs(int f[H_MAX][W_MAX], int y, int x);

using namespace std;

int main(void)
{
	int w,h;

	int i1,i2;
	int count;

	int f[H_MAX][W_MAX];

	while(1){
		cin >> w >> h;
		if(w==0 && h==0) break;

		for(i1=0;i1<H_MAX;i1++){
			for(i2=0;i2<W_MAX;i2++){
				f[i1][i2] = 0;
			}
		}

		for(i1=1;i1<=h;i1++){
			for(i2=1;i2<=w;i2++){
				cin >> f[i1][i2];
			}
		}

		count=0;
		for(i1=1;i1<=h;i1++){
			for(i2=1;i2<=w;i2++){
				if(f[i1][i2]==1){
					count++;
					dfs(f,i1,i2);
				}
			}
		}

		cout << count << endl;
		
	}

	return 0;
}

void dfs(int f[H_MAX][W_MAX],int y,int x)
{
	int i1,i2;

	f[y][x] = 0;
	for(i1=-1;i1<2;i1++){
		for(i2=-1;i2<2;i2++){

			if(f[y+i1][x+i2]==1) dfs(f,y+i1,x+i2);
		}
	}
	return;
}