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>

using namespace std;

int w = 0;
int h = 0;
vector<vector<int>> island;
vector<vector<bool>> reached;

void go(int x_pos, int y_pos);

int main()
{
    while(1){
        cin >> w >> h;
        if(w == 0) break;
        
        island.resize(h);        
        for(int i = 0; i < h; i++){
            island[i].resize(w);
        }
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                cin >> island[i][j];
            }
        }

        reached.resize(h);
        for(int i = 0; i < h; i++){
            reached[i].resize(w);
        }
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                reached[i][j] = false;
            }
        }


        int count = 0;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(island[i][j] == 1 && !reached[i][j]){
                    count++;
                    go(j, i);
                }
            }
        }
        
        cout << count << endl;
        
    }
    return 0;
}

void go(int x_pos, int y_pos)
{
    reached[y_pos][x_pos] = true;
    for(int dx = -1; dx <= 1; dx++){
        for(int dy = -1; dy <= 1; dy++){
            if(x_pos + dx >= 0 && x_pos + dx < w && y_pos + dy >= 0 && y_pos + dy < h){
                if(island[y_pos+dy][x_pos+dx] == 1 && !reached[y_pos+dy][x_pos+dx]){
                    go(x_pos+dx, y_pos+dy);
                }
            }
        }
    }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>

using namespace std;
 
const double eps=1e-10;

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

int main()
{

	int w,h;
	while(cin>>w>>h,w){
		vector< vector<int> > table(h,vector<int>(w));
		int res=0;
		for(int y=0;y<h;y++){
			for(int x=0;x<w;x++) cin>>table[y][x];
		}

		queue< pair<int,int> > q;

		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){

				if(table[i][j]==0) continue;

				res++;
				q.push(make_pair(i,j));

				while(!q.empty()){
					pair<int,int> p=q.front();
					q.pop();
					int y=p.first,x=p.second;

//					cout<<y<<" "<<x<<endl;

					if(table[y][x]==0) continue;

					table[y][x]=0;
					for(int k=0;k<8;k++){
						int nx=x+dx[k],ny=y+dy[k];
						if(0<=nx && nx<w && 0<=ny && ny<h && table[ny][nx]==1) q.push(make_pair(ny,nx));
					}
				}
			}
		}
		cout<<res<<endl;

	}


	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define uniq(x) (x).erase(unique(all(x)),(x).end())

typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
typedef std::priority_queue<int> IntPrioQueue; //Z->A
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z

const int MAX = 64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const int MOD = 1000000007;

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

int maze[MAX][MAX];

int H, W, ans;

bool range(int y, int x) {
    return (0 <= x && x < W && 0 <= y && y < H);
}

void dfs(int y, int x){
    maze[y][x] = 0;
    rep(8, d) {
        if (range(y+dy[d], x+dx[d]) && maze[y+dy[d]][x+dx[d]]) {
            dfs(y+dy[d], x+dx[d]);
        }
    }
    return;
}

void solve(void){
    while (1) {
        //input & init
        scanf("%d %d\n", &W, &H);
        if (W == 0 && H == 0) break;
        rep(H, y) rep(W, x) scanf("%d", &maze[y][x]);
        ans = 0;

        rep(H, y) rep(W, x) {
            if (maze[y][x]) {
                dfs(y, x);
                ans++;
            }
        }
        printf("%d\n", ans);
    }
}

int main(void){
  solve();
  return 0;
}