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>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;

int w, h;
vector<vector<int> > mp;
vector<vector<int> > d;

int dfs(int x, int y){
  vector<int> dx = {1, 1, 1, 0, 0, -1, -1, -1};
  vector<int> dy = {1, 0, -1, 1, -1, 1, 0, -1};
  stack<pair<int, int> > st;
  st.push({x, y});
  d[x][y] = 1;
  while(!st.empty()){
    auto cur = st.top(); st.pop();
    REP(i, 8){
      int nx = cur.first + dx[i];
      int ny = cur.second + dy[i];
      if(nx < 0 || nx > h-1 || ny < 0 || ny > w-1) continue;
      if(mp[nx][ny] == 0 || d[nx][ny] == 1) continue;
      st.push({nx, ny});
      d[nx][ny] = 1;
    }
  }
  return 1;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  vector<int> A;
  while(1){
    cin >> w >> h;
    if(w == 0 && h == 0){
      break;
    }else{
      mp.assign(h, vector<int>(w, 0));
      d.assign(h, vector<int>(w, 0));
      REP(i, h){
        REP(j, w){
          cin >> mp[i][j];
        }
      }
      int ans = 0;
      REP(i, h){
        REP(j, w){
          if(mp[i][j] == 0 || d[i][j] == 1) continue;
          ans += dfs(i, j);
        }
      }
      A.push_back(ans);
    }
  }
  for(auto i : A){
    cout << i << endl;
  }
}

C++: #include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;


int a[50][50]={};
int w,h;

void island(int x,int y)
{
	a[x][y]=0;
	for(int i=-1;i<2;i++)
	{
		for(int j=-1;j<2;y++)
		{
			if( y+j<0||y+j>h-1||x+i>w-1||x+i<0)
			{
				continue;
			}
			if(a[x+i][y+j]==1)
			{
				island(x+i,y+j);
			}
		}
	}
}

int main() 
{
	while(cin>>w>>h,!(w==0&&h==0))
	{
		REP(i,h){REP(j,w){cin>>a[j][i];}}
		int ans(0);
		REP(i,h){REP(j,w){if(a[j][i]==1){island(j,i);ans++;}}}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> pii;

int main()
{
  int i,j,k;
  int h,w;
  int dx[8]={0,1,0,-1,1,1,-1,-1};
  int dy[8]={1,0,-1,0,1,-1,1,-1};

  while(1){

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

    int sum=0;
    int c[55][55]={};

    for(i=1;i<=h;i++)for(j=1;j<=w;j++)cin>>c[i][j];

    while(1){

      queue<pii> q;
      rep(i,h+1)rep(j,w+1)
	if(c[i][j]==1)goto START;
      break;//????????????

    START :
      q.push(pii(i,j));//y,x
      sum++;
      
      while(q.size()){
	i=q.front().first;
	j=q.front().second;
	q.pop();
	c[i][j]=0;
	rep(k,8){
	  int y=i+dy[k];
	  int x=j+dx[k];
	  if(c[y][x]==1){
	    q.push(pii(y,x));
	    c[y][x]=0;
	  }
	}
      }

    }
    cout<<sum<<endl;

  }
}

C++: #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const ll MOD=1e9+7;

int main() {
    ios_base::sync_with_stdio(false);

    while (1) {
        int w,h;
        cin >> w >> h; 
        if (w==0 && h==0) break;
        vector<vector<char>> s(h+2,vector<char>(w+2,'0'));
        rep(i,h) {
            rep(j,w) cin >> s[i+1][j+1];
        }
        int ans=0;
        vector<int> di={-1,-1,-1,0,0,1,1,1},dj={-1,0,1,-1,1,-1,0,1};
        repr(i,1,h+1) {
            repr(j,1,w+1) {
                if (s[i][j]=='1') {
                    queue<pair<int,int>> q;
                    q.push(make_pair(i,j));
                    s[i][j]='0'; 
                    while (!q.empty()) {
                        pair<int,int> p=q.front();
                        q.pop();
                        rep(k,8) {
                            int ni=p.first+di[k],nj=p.second+dj[k];
                            if (s[ni][nj]=='1') {
                                q.push(make_pair(ni,nj));
                                s[ni][nj]='0';
                            }
                        }
                    }
                    ++ans;
                }
            }
        }
        cout << ans << endl;
    }
    
    return 0;
}