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 <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<29;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

bool ok(std::vector<vector<int> > &map, int x, int y) {
    int H = map.size();
    int W = map[0].size();
    if (x < 0 || x >= W || y < 0 || y >= H) return false;
    return true;
}

void color(std::vector<vector<int> > &map, int i, int j) {
    if (map[i][j] == -1) return;
    map[i][j] = -1;

    for (int k = 0; k < 8; k++) {
        int px = j + dx[k];
        int py = i + dy[k];
        if (!ok(map, px, py)) continue;
        if (map[py][px] == 0) continue;
        if (map[py][px] == 1) {
            color(map, py, px);
        }
    }
}

int main(int argc, char const *argv[]) {
    int W, H;
    while(cin >> W >> H) {
        if (W == 0 && H == 0) break;
        std::vector<vector<int> > map(H, vector<int>(W, 0));
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                cin >> map[i][j];
            }
        }
        int count = 0;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (map[i][j] == 1) {
                    count++;
                    color(map, i, j);
                }
            }
        }
        cout << count << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <stack>
#include <utility>

using namespace std;

typedef pair<int, int> pii;

int field[52][52];

int main(){
	while(true){
		int w, h;
		cin >> w >> h;
		if(w == 0 && h == 0){ break; }
		for(int x = 0; x <= w + 1; ++x){ field[0][x] = field[h + 1][x] = 0; }
		for(int y = 1; y <= h; ++y){
			field[y][0] = field[y][w + 1] = 0;
			for(int x = 1; x <= w; ++x){ cin >> field[y][x]; }
		}
		int answer = 0;
		for(int y = 1; y <= h; ++y){
			for(int x = 1; x <= w; ++x){
				if(field[y][x] == 0){ continue; }
				++answer;
				std::stack<pii> stk;
				stk.push(pii(x, y));
				while(!stk.empty()){
					pii pt = stk.top();
					stk.pop();
					if(field[pt.second][pt.first] > 0){
						field[pt.second][pt.first] = 0;
						stk.push(pii(pt.first - 1, pt.second - 1));
						stk.push(pii(pt.first - 1, pt.second));
						stk.push(pii(pt.first - 1, pt.second + 1));
						stk.push(pii(pt.first, pt.second - 1));
						stk.push(pii(pt.first, pt.second + 1));
						stk.push(pii(pt.first + 1, pt.second - 1));
						stk.push(pii(pt.first + 1, pt.second));
						stk.push(pii(pt.first + 1, pt.second + 1));
					}
				}
			}
		}
		cout << answer << endl;
	}
	return 0;
}

C++: // 2013/07/05 Tazoe

#include <iostream>
using namespace std;

void DFS(int M[52][52], int y, int x)
{
	M[y][x] = 0;

	if(M[y-1][x]==1)
		DFS(M, y-1, x);
	if(M[y-1][x+1]==1)
		DFS(M, y-1, x+1);
	if(M[y][x+1]==1)
		DFS(M, y, x+1);
	if(M[y+1][x+1]==1)
		DFS(M, y+1, x+1);
	if(M[y+1][x]==1)
		DFS(M, y+1, x);
	if(M[y+1][x-1]==1)
		DFS(M, y+1, x-1);
	if(M[y][x-1]==1)
		DFS(M, y, x-1);
	if(M[y-1][x-1]==1)
		DFS(M, y-1, x-1);
}

int main()
{
	while(true){
		int w, h;
		cin >> w >> h;

		if(w==0 && h==0)
			break;

		int M[52][52];
		for(int y=0; y<h+2; y++){
			for(int x=0; x<w+2; x++){
				M[y][x] = 0;
			}
		}

		for(int y=1; y<=h; y++){
			for(int x=1; x<=w; x++){
				cin >> M[y][x];
			}
		}

		int cnt = 0;

		for(int y=1; y<=h; y++){
			for(int x=1; x<=w; x++){
				if(M[y][x]==1){
					cnt++;
					DFS(M, y, x);
				}
			}
		}

		cout << cnt << endl;
	}

	return 0;
}

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

int main(){
    do{
        long long w, h;
        cin >> w >> h;
        if(w == 0)break;
        
        vector<vector<int>> c(h + 2, vector<int>(w + 2));
        for(int i = 0; i < h; ++i){
            for(int j = 0; j < w; ++j){
                cin >> c[i + 1][j + 1];
            }
        }
        
        queue<pair<int, int>> q;
        constexpr int move[9] = {0, 1, 1, -1, 0, -1, -1, 1};
        
        long long ans = 0;
        
        for(int i = 1; i <= h; ++i){
            for(int j = 1; j <= w; ++j){
                if(c[i][j]){
                    ++ans;
                    
                    q.emplace(i, j);
                    c[i][j] = false;
                    
                    while(!q.empty()){
                        auto t = q.front();
                        q.pop();
                        for(int i = 0; i < 8; ++i){
                            int y = t.first + move[i];
                            int x = t.second + move[i + 1];
                            if(c[y][x]){
                                q.emplace(y, x);
                                c[y][x] = false;
                            }
                        }
                    }
                    
                }
            }
        }
        
        cout << ans << endl;
        
    }while(true);
    
    return 0;
}