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 <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

using ll = long long;
using ull = uint64_t;
using P = pair<int, int>;
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    for(;;){
        int R, C;
        cin >> R >> C;
        if(R == 0 && C == 0)    return 0;
        vector<vector<int>> c(C, vector<int>(R));
        for(int i = 0; i < C; ++i){
            for(int j = 0; j < R; ++j){
                cin >> c[i][j];
            }
        }
        vector<vector<bool>> used(C, vector<bool>(R, false));
        auto dfs = [&](auto&& self, int x, int y) -> void {
            used[x][y] = true;
            for(int i = 0; i < 8; ++i){
                int nx = x + dx[i], ny = y + dy[i];
                if(nx < 0 || nx >= C || ny < 0 || ny >= R)  continue;
                if(used[nx][ny] || c[nx][ny] == 0)  continue;
                self(self, nx, ny);
            }
            return;
        };
        int ans = 0;
        for(int i = 0; i < C; ++i){
            for(int j = 0; j < R; ++j){
                if(used[i][j] || c[i][j] == 0)  continue;
                ++ans;
                dfs(dfs, i, j);
            }
        }
        cout << ans << '\n';
    }
}

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

int W,H;
int c[51][51]={0};
int d[51][51]={0};
int island=0;

bool valid(pair<int,int> a){
    return (a.first>=1 && a.first<=W && a.second>=1 && a.second<=H);
}

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

void bfs(pair<int,int> s){
    queue<pair<int,int>> Q;

    if(c[s.first][s.second]==1 && d[s.first][s.second]==0 && valid(s)){
        Q.push(s);
        d[s.first][s.second]=1;
        ++island;

        while(!Q.empty()){
            pair<int,int> cur=Q.front();
            Q.pop();

            for(int i=-1;i<=1;++i){
                for(int j=-1;j<=1;++j){
                    pair<int,int> dst=make_pair(cur.first+i,cur.second+j);

                    if(d[dst.first][dst.second]==0 && c[dst.first][dst.second]==1 && valid(dst)){
                        Q.push(dst);
                        d[dst.first][dst.second]=1;
                    }
                }
            }
        }
    }
}

int main(){
    
    while(cin>>W>>H && W!=0){
        for(int i=1;i<=H;++i){
            for(int j=1;j<=W;++j){
                cin>>c[j][i];
            }
        }

        for(int i=1;i<=W;++i){
            for(int j=1;j<=H;++j){
                pair<int,int> start=make_pair(i,j);
                bfs(start);
            }
        }
        cout<<island<<"\n";
        island=0;
        Fill(c,0);
        Fill(d,0);
    }
}

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

template <class T>
void readVector(int n, vector<T> &v){
	for(int i=0; i<n; ++i){
		T t;
		cin >> t;
		v.push_back(t);
	}
}
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
typedef pair<long long, long long> P;

void solve(int w, int h){
	vector<int> v[h];
	for(int i=0; i<h; ++i)
		readVector(w, v[i]);
	int ans = 0;
	for(int i=0; i<h; ++i)
		for(int j=0; j<w; ++j){
			if(v[i][j] == 1){
				++ans;
				v[i][j] = 0;
				queue<P> q;
				q.push(P(i, j));
				while(!q.empty()){
					P p = q.front();
					q.pop();
					int nx = p.first;
					int ny = p.second;
					for(int k=0; k<8; ++k)
						if(0<=nx+dx[k] && nx+dx[k]<h && 0<=ny+dy[k] && ny+dy[k]<w && v[nx+dx[k]][ny+dy[k]] == 1){
							v[nx+dx[k]][ny+dy[k]] = 0;
							q.push(P(nx+dx[k], ny+dy[k]));
						}
				}
			}
		}
	cout << ans << "\n";
}

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	while(1){
		int w, h;
		cin >> w >> h;
		if(w == 0 && h == 0) return 0;
		solve(w, h);
	}
}

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

int map[20][20];

typedef pair<int, int> pxy;

int h, w, ans = 0;

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

void bfs(int sx, int sy)
{
  queue<pxy> q;
  q.push(pxy(sx, sy)); 
  while(!q.empty()){
    int x, y;
    x = q.front().first;
    y = q.front().second;
    q.pop();
    if(map[x][y]){
      map[x][y] = 0;
      for(int i = 0; i < 8; i++){
	int next_x = x + dx[i], next_y = y + dy[i];
	if(map[next_x][next_y] && next_x < w && next_x >= 0 && next_y < h && next_y >= 0){
	  q.push(pxy(next_x, next_y));
	}
      }
    }
  }
}

int main()
{
  while(1){
    cin >> w >> h;
    if(w == 0 && h == 0){
      break;
    }else{
      for(int i = 0; i < h; i++)
	for(int j = 0; j < w; j++)
	  cin >> map[j][i];
      for(int i = 0; i < h; i++)
	for(int j = 0; j < w; j++)
	  if(map[j][i]){
	    ans++;
	    bfs(j, i);
	  }
      cout << ans << endl;
      ans = 0;
    }
  }
}