Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

C++: #include <bits/stdc++.h>
using namespace std;
int w,h,c[100][100],ans;
pair<int,int> movemy[8]={{0,1},{1,0},{1,1},{-1,0},{0,-1},{-1,1},{1,-1},{-1,-1}};


void land(int y,int x){
	if(y<0||y>h-1||x<0||x>w-1||c[y][x]==0)return;
	c[y][x]=0;
	for(int i=0;i<8;i++){
		land(y+movemy[i].first,x+movemy[i].second);
	}
}

int main(){
	while (1){
		ans=0;
		cin>>w>>h;
		if(w==0||h==0)break;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				cin>>c[i][j];
				//cout<<"AAA"<<endl;
			}
		}
		//cout<<"AAA"<<endl;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(c[i][j]){land(i,j);ans++;}
				
			}
		}
		cout<<ans<<endl;
	}
}

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

using i64 = long long int;

int c[51][51] = {0};

void bfs(int w, int h, int x, int y){
    if(x < 0 || x >= w)return;
    if(y < 0 || y >= h)return;
    if(c[y][x] == 0)return;

    c[y][x] = 0;
    for(int dy=-1;dy<=1;++dy){
        for(int dx=-1;dx<=1;++dx)
            bfs(w, h, x+dx, y+dy);
    }
}

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

        int ans = 0;
        for(int i=0;i<h;++i){
            for(int j=0;j<w;++j){
                if(c[i][j] == 1){
                    bfs(w, h, j, i);
                    ans++;
                }
            }
        }

        cout << ans << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
#define ll long long

int W, H;
vector<vector<int>> field;

void dfs(int h, int w) {
	field[h][w] = 0;

	for (int dx = -1; dx <= 1; dx++) {
		for (int dy = -1; dy <= 1; dy++) {
			int nh = h + dy;
			int nw = w + dx;

			if (nh < 0 || nw < 0 || nh >= H || nw >= W)continue;
			if (field[nh][nw] == 0)continue;

			dfs(nh, nw);
		}
	}
}

int main() {
	while (1) {
		cin >> W >> H;
		if (W == 0 && H == 0)break;
		field.assign(H, vector<int>(W, 0));
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) {
				cin >> field[i][j];
			}
		}
		int ans = 0;
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) {
				if (field[i][j] == 0)continue;
				dfs(i, j);
				ans++;
			}
		}
		cout << ans << endl;
	}
	return 0;
}

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

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

int H, W;
int sima[55][55];

bool seen[55][55];
void dfs(int h, int w){
  seen[h][w] = true;
  for(int dir=0; dir<8; dir++){
    int nh = h + dy[dir];
    int nw = w + dx[dir];
    if(nh>=H || nh<0 || nw>=W || nw<0){
      continue;
    }
    if(sima[nh][nw] == 0){
      continue;
    }
    if(seen[nh][nw]){
      continue;
    }
    dfs(nh, nw);
  }
}

int main(){
  while(1){
    cin >> W >> H;
    if(H == 0 && W == 0){
      break;
    }
    for(int h=0; h<H; h++){
      for(int w=0; w<W; w++){
        cin >> sima[h][w];
      }
    }
    memset(seen, 0, sizeof(seen));
    int count=0;
    for(int i=0; i<H; i++){
      for(int j=0; j<W; j++){
        if(seen[i][j]){
          continue;
        }
        if(sima[i][j] == 0){
          continue;
        }
        dfs(i, j);
        count++;
      }
    }
    cout << count << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>

std::vector<int> dx{1, 1, 0, -1, -1, -1, 0, 1};
std::vector<int> dy{0, 1, 1, 1, 0, -1, -1, -1};

void dfs(std::vector<std::vector<bool>> &seen, std::vector<std::vector<int>> &map, int x, int y){
//    std::cout << x << ", " << y << std::endl;
    seen.at(y).at(x) = true;
    for(int i = 0; i < 8; ++i){
        int nextX = x + dx.at(i), nextY = y + dy.at(i);
        if(!seen.at(nextY).at(nextX) && 1 == map.at(nextY).at(nextX)){
            dfs(seen, map, nextX, nextY);
        }
    }
}

int main(){
    int w, h;
    while(std::cin >> w >> h){
        if(0 == w && 0 == h){
            break;
        }

        std::vector<std::vector<int>> map(h + 2, std::vector<int>(w + 2, 0));
        for(int i = 1; i <= h; ++i){
            for(int j = 1; j <= w; ++j){
                std::cin >> map.at(i).at(j); 
            }
        }

        std::vector<std::vector<bool>> seen(h + 2, std::vector<bool>(w + 2, false));
        int count = 0;
        for(int i = 1; i <= h; ++i){
            for(int j = 1; j <= w; ++j){
                if(!seen.at(i).at(j) && 1 == map.at(i).at(j)){
                    dfs(seen, map, j, i);
                    ++count;
                } 
            }
        }
    
        std::cout << count << std::endl;
    }

    return 0;
}