Go: package main

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

var (
	readString func() string
	readBytes  func() []byte
	stdout     *bufio.Writer
)

func init() {
	readString, readBytes = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) (func() string, func() []byte) {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), math.MaxInt32)
	r.Split(bufio.ScanWords)

	f1 := func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
	f2 := func() []byte {
		return []byte(f1())
	}
	return f1, f2
}

func readInt() int {
	return int(readInt64())
}

func readInt64() int64 {
	i, err := strconv.ParseInt(readString(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(readString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(stdout, f, args...)
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdout, args...)
}

func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func min64(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func max64(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func abs64(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func gcd64(a, b int64) int64 {
	if b == 0 {
		return a
	}
	return gcd64(b, a%b)
}

// readString() string
// readInt() int
// readInt64() int64
// readFloat64() float64

// -----------------------------------------------------------------------------

func main() {
	defer stdout.Flush()

	for {
		ans, ok := solve()
		if !ok {
			break
		}
		println(ans)
	}

}

func solve() (int, bool) {
	w := readInt()
	h := readInt()
	if w == 0 && h == 0 {
		return 0, false
	}

	c := make([][]int, h+2)
	c[0] = make([]int, w+2)
	c[h+1] = make([]int, w+2)
	for i := 1; i-1 < h; i++ {
		c[i] = make([]int, w+2)
		for j := 1; j-1 < w; j++ {
			c[i][j] = readInt()
		}
	}

	var ans int
	for i := 1; i-1 < h; i++ {
		for j := 1; j-1 < w; j++ {
			if 0 < c[i][j] {
				ans++
				dfs(c, i, j)
			}
		}
	}
	return ans, true
}

func dfs(c [][]int, y, x int) {
	c[y][x] = 0
	dx := []int{-1, 0, 1, -1, 1, -1, 0, 1}
	dy := []int{-1, -1, -1, 0, 0, 1, 1, 1}
	for i := range dx {
		nx := x + dx[i]
		ny := y + dy[i]
		if 0 < c[ny][nx] {
			dfs(c, ny, nx)
		}
	}
}

// -----------------------------------------------------------------------------

C++: #include<bits/stdc++.h>
using namespace std;
int w,h;
int a[1000][1000];
int dx[8]={1,1,0,-1,-1,-1,0,1},dy[8]={0,1,1,1,0,-1,-1,-1};
void DFS(int x,int y){
    a[y][x]=0;
    for(int i=0;i<8;i++){
        int nx=x+dx[i];
        int ny=y+dy[i];
        if(nx>=0 && nx<w && ny>=0 && ny<h && a[ny][nx]==1){
            DFS(nx,ny);
        }
    }
}
int main(void){
    int cnt;
    while(1){
        cnt=0;
        cin>>w>>h;
        if(w==0 && h==0){
            return 0;
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                cin>>a[i][j];
            }
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(a[i][j]==1){
                    cnt++;
                    DFS(j,i);
                }
            }
        }
        cout<<cnt<<endl;
    }
}

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;
    }
}