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 <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))

using namespace std;

bool field[51][51];
int w, h, cnt;
int dx[] = { 1, 0, 0, -1, 1, -1, -1, 1}, dy[] = {0, 1, -1, 0, 1, 1, -1, -1};



void rec(int x, int y)
{
	if( x >= 0 && x < w && y >= 0 && y < h && field[y][x] == 1)
	{
		field[y][x] = 0;
	
		FOR(i, 0, 8)
			rec(x+dx[i], y+dy[i]);
	}
	return;
}



int main()
{
	while( cin >> w >> h, (w||h))
	{
		cnt = 0;
		
		FOR(j, 0, h)
			FOR(i, 0, w)
				cin >> field[j][i];
		
		FOR(j, 0, h)
			FOR(i, 0, w)
			{
				if( field[j][i] == 1)
					cnt++;
					rec(i, j);
			}
		
		
		cout << cnt << endl;
	}
	
	return 0;
}

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

using namespace std;

int w,h;
int g[51][51];
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void dfs(int x,int y){
  g[y][x]=0;
  for(int i=0;i<4;i++){
    int nx=x+dx[i],ny=y+dy[i];
    if(0<=nx && nx<w && 0<=ny && ny<h && g[ny][nx]==1)
      dfs(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 >> g[i][j];

    int cnt=0;
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++)
	if(g[i][j]==1)cnt++,dfs(j,i);

    cout << cnt << endl;
  }
  
  return 0;
}

C++: #include <iostream>
using namespace std;
int map[51][51],w,h;
void dfs(int y,int x){
	map[y][x] = 0;
	int tx,ty;
	for(int dx=-1;dx<=1;dx++){
		for(int dy=-1;dy<=1;dy++){
			tx = x + dx;
			ty = y + dy;
			if(tx > -1 && tx < w && ty > -1 && ty < h && map[ty][tx] == 1) dfs(ty,tx);
		}
	}
	return;

}
int main(){
	int count;
	while(cin >> w >> h && (w!=0 && h!=0)){
		count = 0;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				cin >> map[i][j];
			}
		}
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(map[i][j] == 1){
					dfs(i,j);
					count++;
				}
			}
		}
		cout << count << endl;
	}
	return 0;
}

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

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

void dfs(int x, int y, vector<vector<bool> >& canGo){
  canGo[x][y] = false;
  for(int i = 0; i < 9; i++)
    if(canGo[x + dx[i]][y + dy[i]])
      dfs(x + dx[i], y + dy[i], canGo);
  return;
}


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

    int input;
    vector<vector<bool> > canGo(h + 2, vector<bool>(w + 2, false));
    for(int i = 1; i <= h; i++){
      for(int j = 1; j <= w; j++){
        cin >> input;
        if(input == 1){ canGo[i][j] = true; }
      }
    }

    int count = 0;
    for(int i = 1; i <= h; i++){
      for(int j = 1; j <= w; j++){
        if(canGo[i][j]){
          ++count;
          dfs(i, j, canGo);
        }
      }
    }

    cout << count << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int ans = 1e9;
int H,W;
int mp[52][52];
int nx,ny;
void func(int y,int x){
	//cout << y << ' ' <<x<<endl;
	if(mp[y][x] == 1){
		mp[y][x] = 2;
		func(y,x);
	}
	if(mp[y+1][x] == 1){
		mp[y+1][x] = 2;
		func(y+1,x);
	}
	if(mp[y][x+1] == 1){
		mp[y][x+1] = 2;
		func(y,x+1);
	}
	if(mp[y+1][x+1] == 1){
		mp[y+1][x+1] = 2;
		func(y+1,x+1);
	}
	if(mp[y-1][x] == 1){
		mp[y-1][x] = 2;
		func(y-1,x);
	}
	if(mp[y][x-1] == 1){
		mp[y][x-1] = 2;
		func(y,x-1);
	}
	if(mp[y-1][x-1] == 1){
		mp[y-1][x-1] = 2;
		func(y-1,x-1);
	}
	if(mp[y+1][x-1] == 1){
		mp[y+1][x-1] = 2;
		func(y+1,x-1);
	}
	if(mp[y-1][x+1] == 1){
		mp[y-1][x+1] = 2;
		func(y-1,x+1);
	}
}
void findL(){
	nx = -1;ny = -1;
	for(int i = 1; i <= H; i++){
		for(int j = 1; j <= W; j++){
			if(mp[i][j] == 1){
				nx = j,ny = i;
				//cout <<nx<<ny<<endl;
				i = H; j = W;
			}
		}
	}
}
int main(){
	cin >> H>>W;
	while(W!=0||H!=0){
		for(int i = 0; i < 52;i++){
			for(int j = 0; j < 52; j++){
				mp[i][j] = 0;
			}
		}
		for(int i = 1; i <= H; i++){
			for(int j = 1; j <= W; j++){
				cin >> mp[i][j];
			}
		}
		int c = 0;
		findL();
		while(nx != -1 && ny != -1){
			func(ny,nx);
			c++;
			findL();
		}
		cout << c << endl;
		cin >> W >> H;
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int m[51][51];
int w, h;
const int dx[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};

void dfs(int x, int y)
{
    m[x][y] = 0;
    for (int i = 0; i < 8; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        
        if (nx < 0 || ny < 0 || nx >= h || ny >= w)
            continue;
        else if (m[nx][ny] == 1)
            dfs(nx, ny);
    }
}

int main()
{
    while (cin >> w >> h, w || h) {
        int isl = 0;

        for (int i = 0; i < h; i++)
            for (int j = 0; j < w; j++)
                cin >> m[i][j];

        for (int i = 0; i < h; i++) 
            for (int j = 0; j < w; j++)
                if (m[i][j] == 1) {
                    dfs(i, j);
                    isl++;
                }

        cout << isl << endl;
    }

    return 0;
}

C++: // A0J 1160 How Many Islands?

#include <iostream>

# define REP(i,n) for(int i=0; i<n;i++)

using namespace std;

int map[51][51];
int moumita[51][51];
int w,h;

bool check(int j, int k){
	if (j>=0 && j<h && k>=0 && k<w && map[j][k]==1 && !moumita[j][k]) return true;
	else return false;
}

int dfs(int j, int k){
	moumita[j][k] = true;
	
	if (check(j-1,k-1)) dfs(j-1,k-1);
	if (check(j-1,k)) dfs(j-1,k);
	if (check(j-1,k+1)) dfs(j-1,k+1);
	if (check(j,k-1)) dfs(j,k-1);
	if (check(j,k+1)) dfs(j,k+1);
	if (check(j+1,k-1)) dfs(j+1,k-1);
	if (check(j+1,k)) dfs(j+1,k);
	if (check(j+1,k+1)) dfs(j+1,k+1);
	
	return 1;
}

int main(){
	while (true){
		int ans;
		ans = 0;
		cin >> w >> h;
		
		if (w==0 && h==0) break;
		
		REP(j,h){
			REP(k,w){
				cin >> map[j][k];
				moumita[j][k] = false;
			}
		}
		
		REP(j,h){
			REP(k,w){
				if (check(j,k))	ans += dfs(j,k);
			}
		}
		
		cout << ans << endl;
	}
	return 0;
}