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 "bits/stdc++.h"
using namespace std;

#define rep(i, n) for(auto i=0; i != n; ++i)
#define REP(i, k, n) for(auto i=k; i != n; ++i)
#define rrep(i, n) for(auto i=n; i != 0; --i)
#define RREP(i, n, k) for(auto i=n; i != k; --i)


int sea[60][60];
int w,h;
void dfs(int x, int y){
    int dx[] = {0, 1, -1};
    int dy[] = {0, 1, -1};

    if(sea[x][y] == -1) return ;

    if(sea[x][y] == 1){
        sea[x][y] = -1;
    }

    for(int xx=-1; xx<=1; xx++){
        for(int yy=-1; yy<=1; yy++){
            if(xx==0 && yy==0){
                continue;
            }

            if(sea[x + xx][y + yy] == 1){
                dfs(x+xx, y+yy);

            }

        }
    }



}

int main (){
    while (true){
        cin>>w>>h;
        if(w==0 && h==0){ break;}
        rep(i, 60){
            rep(j,60){
                sea[i][j] = -1;
            }
        }

        rep(i, h){
            rep(j,w){
                cin>>sea[i+1][j+1];
            }
        }


        int ans = 0;
        rep(i, h){
            rep(j,w){
                if(sea[i+1][j+1] == 1){
                    dfs(i+1,j+1);
                    ans++;
                }
            }
        }

        cout<<ans<<endl;

    }

}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int w, h;

void dfs(int x, int y, vector<vector<int>> &c) {
  if (x < 0 || y < 0 || x >= h || y >= w) {
    return;
  }
  if (c[x][y] == 0) {
    return;  // umi or seeen
  }
  c[x][y] = 0;

  for (int i = 0; i < 8; i++) {
    dfs(x + dx[i], y + dy[i], c);
  }
}
int main() {
  vector<int> ans;
  while (1) {
    cin >> w >> h;
    if (w == 0 && h == 0) {
      break;
    }
    vector<vector<int>> c(h, vector<int>(w));

    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        cin >> c[i][j];
      }
    }
    int count = 0;
    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        if (c[i][j] == 1) {
          dfs(i, j, c);
          count++;
        }
      }
    }
    ans.push_back(count);
  }
  for (auto it = ans.begin(); it != ans.end(); it++) {
    cout << *it << endl;
  }
}