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>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
#define WHITE 0
#define GRAY 1
typedef long long LL;
const int MAXN = 60;
int w,h,ans, mapp[MAXN][MAXN], color[MAXN][MAXN];
vector<int> v_ans;

void dfs_visit(int u,int k) {

	color[u][k] = GRAY;//参照したことを示す


	if(mapp[u][k + 1] == 1 && color[u][k + 1] == WHITE) {//右
		dfs_visit(u,k + 1);
	}

	if(mapp[u + 1][k + 1] == 1 && color[u + 1][k + 1] == WHITE) {//右下
		dfs_visit(u + 1,k + 1);
	}

	if(mapp[u + 1][k] == 1 && color[u + 1][k] == WHITE) {//下
		dfs_visit(u + 1,k);
	}

    if(k > 0){
        if(mapp[u + 1][k - 1] == 1 && color[u + 1][k - 1] == WHITE) {// 左下
            dfs_visit(u + 1,k - 1);
        }
    }

    if(k > 0){
        if(mapp[u][k - 1] == 1 && color[u][k - 1] == WHITE) {// 左
            dfs_visit(u,k - 1);
        }
    }

    if(u > 0){
        if(mapp[u - 1][k] == 1 && color[u - 1][k] == WHITE) {// 上
            dfs_visit(u - 1,k);
        }
    }

    if(u > 0){
        if(mapp[u - 1][k + 1] == 1 && color[u - 1][k + 1] == WHITE) {// 右上
            dfs_visit(u - 1,k + 1);
        }
    }

    if(u > 0 && k > 0){
        if(mapp[u - 1][k - 1] == 1 && color[u - 1][k - 1] == WHITE) {// 左上
            dfs_visit(u - 1,k - 1);
        }
    }


}

void dfs() {
    int ans = 0;
	for(int i = 0; i < h; i++) {
        for(int j = 0; j < w; j++){
            if(mapp[i][j] == 1 && color[i][j] == WHITE ) {//未探訪の島なら探索

                dfs_visit(i,j);
                ans += 1;
            }
        }

	}

	v_ans.push_back(ans);

}

int main() {

    while(1){
        memset(mapp, 0, sizeof(mapp));//木情報をリセット
        memset(color, 0, sizeof(color));//探訪情報をリセット
        cin >> w >> h;
        if(w == 0) break;
        for(int i = 0; i < h; i++){

            for(int j = 0; j < w; j++){
                cin >> mapp[i][j];
            }

        }
        dfs();
    }
    rep(i,v_ans.size()) cout <<v_ans[i] <<endl;
	return 0;
}