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<queue>
using namespace std;

struct mapst {
	int x, y;
};

int main() {
	int w, h, ans=0;
	int c[52][52]={{0}}, f[52][52]={{1}};
	int dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
	int dy[8] = {0, -1, -1, -1, 0, 1, 1, 1};
	queue<mapst> q;
	while(1) {
		cin >> w >> h;
		if(!w&&!h) break;
		ans = 0;
		for(int i=0; i<52; ++i) for(int j=0; j<52; ++j) {
			c[i][j] = 0;
			f[i][j] = 1;
		}
		for(int i=1; i<=h; ++i) for(int j=1; j<=w; ++j) {
			cin >> c[i][j];
			f[i][j] = 1-c[i][j];
		}
		for(int i=1; i<=h; ++i) for(int j=1; j<=w; ++j) {
			if(c[i][j]&&!f[i][j]) {
				mapst m, ms;
				m.x = j; m.y = i;
				q.push(m);
				ans++;
				while(!q.empty()) {
					m = q.front();
					q.pop();
					f[m.y][m.x] = 1;
					for(int k=0; k<8; k++) {
						int nx = m.x + dx[k], ny = m.y + dy[k];
						if(c[ny][nx]&&!f[ny][nx]) {
							ms.x = nx; ms.y = ny;
							q.push(ms);
						}
					}
				};
			}
		}
		cout << ans << endl;
	}
	return 0;
}

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

const int limit=55;
int grid[limit][limit];
int w, h;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

void dfs(int, int);

int main(){
  while(cin >> w >> h, w!=0 && h!=0){
    //グリッドに情報格納
    for(int i=0; i<h; i++){
      for(int j=0; j<w; j++) cin >> grid[i][j];
    }

    int cnt=0;
    for(int i=0; i<h; i++){
      for(int j=0; j<w; j++){
        if(grid[i][j]==1){
          dfs(i, j);
          cnt++;
        }
      }
    }
    cout << cnt << endl;
  }

  return 0;
}

void dfs(int y, int x){
  if(grid[y][x]==0) return;
  if(y<0 || y>=h || x<0 || x>=w) return;

  grid[y][x] = 0;

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

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

using namespace std;

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

int dp[55][55];

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

void dfs(int x, int y)
{
	if (!dp[x][y]) return;
	dp[x][y] = 0;
	rep(i, 8) dfs(x + dx[i], y + dy[i]);
}

int main(void)
{
	while(1) {
		int w, h;
		cin >> w >> h;
		if (!w) break;
		rep(i, h + 2) rep(j, w + 2) dp[i][j] = 0;
		rep(i, h) rep(j, w) {
			cin >> dp[i + 1][j + 1];
		}
		
		int ret = 0;
		rep(i, h) rep(j, w) {
			if (!dp[i + 1][j + 1]) continue;
			ret++;
			dfs(i + 1, j + 1);
		}
		cout << ret << endl;
	}
	return 0;

}

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

int m[51][51];
bool check[51][51];

void dfs(int y, int x, int w, int h){
    if(x < 0 || y < 0 || y >= h || x >= w) return;
    if(m[y][x] == 1 && !check[y][x]){
        check[y][x] = true;
        // cout << "[" << y << "," << x << "]" << endl;
        for(int dx = -1; dx <= 1; ++dx){
            for(int dy = -1; dy <= 1; ++ dy){
                dfs(y + dy, x + dx, w, h);
            }
        }
    }
}

int main() {
    int w, h;
    cin >> w >> h;
    
    while(w != 0 && h != 0){
        int res = 0;
        rep(i, 51) rep(j, 51){
            m[i][j] = 0;
            check[i][j] = false;
        }
        rep(i, h) rep(j, w) cin >> m[i][j];
        
        rep(i, h) rep(j, w){
            if(m[i][j] == 1 && !check[i][j]){
                ++res;
                // cout << "start[" << i << "," << j << "]" << endl; 
                dfs(i, j, w, h);
            }   
        }
        
        cout << res << endl;
        cin >> w >> h;
    }
    
    return 0;
}

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

int w,h;
int fd[50][50];

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

void dfs(int x, int y){
	fd[y][x] = 0;
	for(int i=0; i<8; i++){
		int mx = x+dx[i];
		int my = y+dy[i];
		if(0<=mx && mx<w && 0<=my && my<h && fd[my][mx])
			dfs(mx, my);
	}
}

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

		int count=0;
		for(int y=0; y<h; y++)
			for(int x=0; x<w; x++)
				if(fd[y][x]){
					count++;
					dfs(x,y);
				}
		
		cout << count << endl;
	}

	return 0;
}