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<iostream>
#include<queue>
#include<utility>
using namespace std;
void search(int, int);
int c[60][60] = {}, map[60][60] = {};
void mapDraw(int,int);
queue< pair<int, int> > q;
int w, h;

int main() {

	while (1) {
		
		//initialize
		int count = 0;
		for (int i = 0; i < 60; i++) {
			for (int j = 0; j < 60; j++) {
				c[i][j] = 0;
				map[i][j] = 0;
			}
		}


		cin >> w >> h;
		if (w == 0 && h == 0) break;
		//input
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				cin >> c[i][j];
			}
		}

		//search
		//unresearched:0, land:2, sea:1
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (map[i][j] == 0) {
					map[i][j] = c[i][j] + 1;
					if (c[i][j] == 1) {
						q.push(make_pair(i, j));
						count++;
					}
				}

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

					//cerr << "( " << y << ", " << x << " )now"<< endl;

					for (int a = -1; a <= 1; a++) {
						for (int b = -1; b <= 1; b++) search(y + a, x + b);
					}
				}
			}
		}

		cout << count << endl;
	}


	return 0;
}

void search(int i, int j) {
	if (i < h&&i >= 0 && j < w&&j >= 0) {
		if (map[i][j] == 0) {
			map[i][j] = c[i][j] + 1;
			if (c[i][j] == 1) q.push(make_pair(i, j));
		}
	}
	//mapDraw(w, h);
}

void mapDraw(int w, int h) {
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			cerr << map[i][j];
		}
		cerr << endl;
	}
	cerr << endl;
}

C++: #include<iostream>
#include<vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=a;i<=b;i++)
#define pii pair<int,int>
int w,h;

int main(){
    while(1){
        w=h=0;
        cin>>w>>h;
        int ans=0;
        if(w==0&&h==0)break;
        vector<vector< int > > c(60,vector<int>(60));
        rep2(i,1,h)rep2(j,1,w){
            cin>>c[i][j];
        }
        vector< vector< int> > visited(60,vector<int>(60));
        rep2(i,1,h){
            rep2(j,1,w){
                if(visited[i][j]||!c[i][j])continue;
                queue<pii> q;
                q.push(pii(i,j));
                visited[i][j]=1;
                while(!q.empty()){
                    pii P=q.front();
                    //cout<<P.first<<" "<<P.second<<endl;
                    q.pop();
                    rep2(ii,-1,1){
                        rep2(jj,-1,1){
                            if(c[P.first+ii][P.second+jj]&&!visited[P.first+ii][P.second+jj]){
                                q.push(pii(P.first+ii,P.second+jj));
                                visited[P.first+ii][P.second+jj]=1;
                            }
                        }
                    }
                }
                if(c[i][j])ans++;
            }
        }
        cout<<ans<<endl;
    }

}

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

using namespace std;

pair<int, int> serch_land(vector<vector<int> >& maps){
  for(int i = 0; i < maps.size(); i++){
    for(int j = 0; j < maps[i].size(); j++){
      if(maps[i][j] == 1){
        return make_pair(i, j);
      }
    }
  }
  return make_pair(-1, -1);
}

void delete_land(vector<vector<int> >& maps, pair<int, int> start){
  int dh[8] = {1, 1, 1, 0, 0, -1, -1, -1};
  int dw[8] = {1, 0, -1, 1, -1, 1, -1, 0};

  stack< pair<int, int> > s;
  s.push(start);
  pair<int, int> cur;
  maps[start.first][start.second] = 0;

  while(!s.empty()){
    cur = s.top();
    s.pop();

    for(int i = 0; i < 8; i++){
      if(maps[cur.first + dh[i]][cur.second + dw[i]] == 1){
        maps[cur.first + dh[i]][cur.second + dw[i]] = 0;
        pair<int, int> next = make_pair(cur.first + dh[i], cur.second + dw[i]);
        s.push(next);
      }
    }
  }
}

int main(){
  int w, h;

  while(cin >> w >> h, !(w == 0 && h == 0)){
    vector<vector<int> > maps = vector<vector<int> >(h+2, vector<int>(w+2));
    pair<int, int> land;

    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){
          maps[i][j] = 0;
        }else{
          cin >> maps[i][j];
        }
      }
    }


    int cnt = 0;
    while(land = serch_land(maps), land.first != -1){
      cnt++;
      delete_land(maps, land);
    }
    cout << cnt << endl;

  }
}

C++: #include <bits/stdc++.h>

typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8  fixed<<setprecision(8) 
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

using namespace std;
int f[64][64];

int del(int i,int j)
{
  if(i<0||j<0) return 0;
  if(f[i][j]){
    f[i][j]=0;
    REP(di,3) REP(dj,3)
      del(i+di-1,j+dj-1);
    return 1;
  }
  else return 0;
}
int main(void)
{
  for(;;){
    int n,m;
    cin >> n >> m;
    if(!n&&!m) return 0;
    REP(j,m){
      REP(i,n)
	cin >> f[i][j];
    }
    int answer=0;
    REP(j,m){
      REP(i,n)
	answer+=del(i,j);
    }
    cout << answer << endl;
  }
}