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 <queue>
#include <map>

#define LAND '1'  //??? char???
#define SEA  '0'   //??? char???

using namespace std;

/* ?????????
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
*/

/*8??????*/
int dx[] = {1,1,0,-1,-1,-1, 0, 1};
int dy[] = {0,1,1, 1, 0,-1,-1,-1};

bool input(vector< vector<char> > &m);
void delete_island(vector< vector< char > > &m, int x, int y);
void output(vector< vector< char> > m);


int main(){
  int w, h;
    
  while(cin >> w >> h, w && h){
    vector< vector< char > > m(h+2, vector<char>(w+2));
    input(m);
    
    int island = 0;
    for(int y = 0; y < m.size(); y++){
      for(int x = 0; x < m[y].size(); x++){
	if(m[y][x] == LAND){
	  delete_island(m,x,y);
	  island++;
	}
      }
    }
    cout << island << endl;
  }
}


bool input(vector< vector<char> > &m){
  for(int y = 0; y < m.size(); y++){
    for(int x = 0; x < m[y].size(); x++){
      if(y == 0 || x == 0 ||
	 y == m.size()-1 || x == m[y].size()-1){
	m[y][x] = SEA;
      }else{
	if(!(cin >> m[y][x])) return false;
      }
    }
  }
  return true;
}


 void delete_island(vector< vector< char > > &m, int x, int y){
   queue< pair< int, int > > q;
   q.push(make_pair(x,y));

   while(!(q.empty())){
     pair<int, int> cur = q.front();
     q.pop();
     if(m[cur.second][cur.first] == LAND){
       m[cur.second][cur.first] = SEA;
       for(int i = 0; i < sizeof(dx)/sizeof(int); i++){
	 q.push(make_pair(cur.first+dx[i],cur.second+dy[i]));
       }
     }
   }
}

void output(vector< vector< char> > m){
  for(int y = 0; y < m.size()-1; y++){
    for(int x = 0; x < m[y].size()-1; x++{
      cout << m[y][x] << " ";
    }
    cout << endl;
  }
  cout << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int w,h,ans;
  bool b;
  int mp[70][70];
  while(1){
    cin>>w>>h;
    if(w==0 && h==0) break;
    for(int i=0;i<70;i++){
      for(int j=0;j<70;j++){
	mp[i][j]=0;
      }
    }
    ans=2;
    for(int i=1;i<=h;i++){
      for(int j=1;j<=w;j++){
	cin>>mp[i][j];
      }
    }
    for(int i=1;i<=h;i++){
      for(int j=1;j<=w;j++){
	b=true;
	if(mp[i][j]==1){
	  mp[i][j]=ans;
	  while(b){
	    b=false;
	    for(int k=1;k<=h;k++){
	      for(int l=1;l<=w;l++){
		if(mp[k][l]==ans){
		  for(int m=k-1;m<=k+1;m++){
		    for(int n=l-1;n<=l+1;n++){
		      if(mp[m][n]==1){
			mp[m][n]=ans;
			b=true;
		      }
		    }
		  }
		}
	      }
	    }
	  }
	  ans++;
	}
      }
    }
    cout<<ans-2<<endl;
  }
  return 0;
}

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

int h,w;
int maps[50][50];
int dy[]={-1,-1,-1,0,0,0,1,1,1};
int dx[]={-1,0,1,-1,0,1,-1,0,1};

void dfs(int y,int x);

int main(){
  int cnt;
  while(cin >> w >> h,w|h){
    cnt = 0;
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
	cin>>maps[i][j];
      }
    }
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
	if(maps[i][j] == 1){
	  cnt++;
	  dfs(i,j);
	}
      }
    }
    cout << cnt << endl;
  }
}

void dfs(int y,int x){
  maps[y][x] = 0;
  for(int i = 0; i < 9;i++){
    int sy = y + dy[i];
    int sx = x + dx[i];
    if(sy >= 0 && sy < h && sx >= 0 && sx < w && maps[sy][sx] == 1){
      dfs(sy,sx);
    }
  }
  return;
}

C++: #include <iostream>
using namespace std;
int h,w,dp[50][50],dx[]={0,0,1,1,1,-1,-1,-1},dy[]={1,-1,0,1,-1,0,1,-1},ch[50][50],ans;
void dfs(int x,int y){
    for(int i=0;i<8;i++){
        int nx=x+dx[i];
        int ny=y+dy[i];
        if(0<=nx&&nx<h&&0<=ny&&ny<w&&dp[nx][ny]==1){
            if(ch[nx][ny]==0){
                ch[nx][ny]=1;
                dfs(nx,ny);
            }
        }
    }
    return ;
}
int main(void){
    while(1){
        cin>>w>>h;
        if(w==0&&h==0)return 0;
        ans=0;
        for(int i=0;i<h;i++)for(int j=0;j<w;j++){
            ch[i][j]=0;
            cin>>dp[i][j];
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(dp[i][j]==1&&ch[i][j]==0){
                    dfs(i,j);
                    ans++;
                }
            }
        }
        cout<<ans<<endl;
    }
}

C++: #include <iostream>

using namespace std;

int w, h;
int m[50][50];
void paint(int x, int y) {
	if (x < 0 || x >= w || y < 0 || y >= h) return;
	if (m[y][x] == 0) return;
	m[y][x] = 0;
	for (int dx = -1; dx <= 1; ++dx) for (int dy = -1; dy <= 1; ++dy) {
		paint(x+dx, y+dy);
	}
}
int main() {
	while ( cin >> w >> h, w || h ) {
		for (int y = 0; y < h; ++y) {
			for (int x = 0; x < w; ++x) {
				cin >> m[y][x];
			}
		}
		int ans = 0;
		for (int y = 0; y < h; ++y) {
			for (int x = 0; x < w; ++x) {
				if (m[y][x]) {
					paint(x, y);
					++ans;
				}
			}
		}
		cout << ans << endl;
	}
}

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

using namespace std;
typedef long long ll;

int w, h;
vector<vector<int> > c;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};


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

int main() {
    while (true) {
        cin >> w >> h;
        if (w == 0 && h == 0) break;
        c.resize(h);
        for (int i = 0; i < h; i++) {
            c[i].resize(w);
            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] == 0) continue;
                dfs(i, j);
                ans++;
            }
        }
        cout << ans << endl;
    }
}