Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

C++: #include<iostream>
#include<cmath>
#include<algorithm>

using namespace std;

int w,h;
bool grid[50][50];

void rec(int x,int y){
  grid[y][x]=false;
  for(int i=-1;i<2;i++){
    for(int j=-1;j<2;j++){
      int ny=y+i,nx=x+j;
      if(0<=nx && nx<w && 0<=ny && ny<h)
	if(grid[ny][nx])rec(nx,ny);
    }
  }
}

int main(void){

  while(cin >> w >> h,w|h){
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
	cin >> grid[i][j];
      }
    }
    
    int ans=0;
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
	if(grid[i][j])rec(j,i),ans++;
      }
    }
    cout << ans << endl;
  }

  return 0;
}

C++: //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

#define int long long

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

signed main()
{
    int w, h;
    while(cin>>w>>h, w) {
        int field[h+1][w+1];
        for(int i=0; i<h; ++i) {
            for(int j=0; j<w; ++j) {
                int c;
                cin >> c;
                field[i][j] = c;
            }
        }

        int ans = 0;
        for(int i=0; i<h; ++i) {
            for(int j=0; j<w; ++j) {
                if(field[i][j]==1) {
                    ans++;
                    queue<pair<int, int> > q;
                    q.push(make_pair(i, j));
                    while(!q.empty()) {
                        pair<int, int> p = q.front();
                        q.pop();
                        int x = p.first;
                        int y = p.second;
                        field[x][y] = 0;
                        for(int k=0; k<8; ++k) {
                            int nx = x + dx[k];
                            int ny = y + dy[k];
                            if(nx>=0&&nx<h&&ny>=0&&ny<w&&field[nx][ny]==1) {
                                q.push(make_pair(nx, ny));
                            }
                        }
                    }
                }
            }
        }

        cout << ans << endl;
    }
    return 0;
}

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

using namespace std;

int field[50][50];
int N,M;
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<N&&0<=ny&&ny<M&&field[nx][ny]==1)dfs(nx,ny);
        }
    }
}
int main(){
    for(;;) {
        cin>>M>>N;
        if(N==0)break;
        rep(i,N){
            rep(j,M){
                cin>>field[i][j];
            }
        }
        int res = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                if (field[i][j] == 1) {
                    dfs(i, j);
                    res++;
                }
            }
        }
        cout << res << endl;
    }
}

C++: #include<iostream>
using namespace std;
int Island[52][52];
void solve(int y,int x) {
	Island[y][x] = 0;
	for (int i = -1; i <= 1; ++i) {
		for (int j = -1; j <= 1; ++j) {
			if (Island[y + i][x + j]) solve(y + i, x + j);
		}
	}
}
int main() {
	int w,h;
	while (cin >> w >> h&&w&&h) {
		int cnt = 0;
		for (int i = 0; i < h + 2; ++i) {
			for (int j = 0; j < w + 2; ++j) {
				if (i == 0 || j == 0 || i == h + 1 || j == w + 1) Island[i][j] = 0;
				else cin >> Island[i][j];
			}
		}
		for (int i = 1; i < h + 1; ++i) {
			for (int j = 1; j < w + 1; ++j) {
				if (Island[i][j]) {
					solve(i, j);
					++cnt;
				}
			}
		}
		cout << cnt << endl;
	}
	return 0;
}