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;

vector<vector<bool>> seen;
int H, W;
int d_h[8] = {1,1,1,0,0,-1,-1,-1};
int d_w[8] = {1,0,-1,1,-1,1,0,-1};

void dfs(const vector<vector<int>> &m, int h, int w){
    seen[h][w] = true;

    //cout << h << ' ' << w <<  ' ' << m[h][w] << endl;
    
    for(int i = 0; i < 8; i++){
        if(1 <= h+d_h[i] && h+d_h[i] <= H && 1 <= w+d_w[i] && w+d_w[i] <= W && (!seen[h+d_h[i]][w+d_w[i]]) && m[h+d_h[i]][w+d_w[i]] == 1){
            dfs(m, h+d_h[i], w+d_w[i]);
        }
    }
}

int main(){
    while(1){
        cin >> W >> H;
        seen.assign(H+1, vector<bool>(W+1, false));
        if(H == 0 && W == 0) break;
        vector<vector<int>> m(H+1, vector<int>(W+1,0));
        for(int i = 1; i <= H; i++){
            for(int j = 1; j <= W; j++){
                cin >> m[i][j];
            }
        }

        int cnt = 0;
        for(int i = 1; i <= H; i++){
            for(int j = 1; j <= W; j++){
                if(!seen[i][j] && m[i][j] == 1) {
                    //cout << i << ' ' << j << endl;
                    cnt++;
                    dfs(m, i, j);
                }
            }
        }
        cout << cnt << endl;
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(pair<int, int> a, pair<int, int> b) {
    if(a.first != b.first){
        return a.first < b.first;
        
    }else{
        return a.second < b.second;
    }
}
// 入力

vector<vector<ll> > G;
vector<bool> seen;


//ll fcnt=1;
void dfs(ll v){
    seen[v] = 1;

    rep(i,G[v].size()){
        if(seen[G[v][i]] == 0){
            dfs(G[v][i]);
        }
    }

}

int main() {
    
    while(1){
        G.clear();
        seen.clear();
        ll w,h;
    
        cin >> w>>h;
        if(w==0 &&h==0) break;
        ll cnt=1;
        map<pair<ll,ll>,ll> m;
        
        rep(i,h){
            rep(j,w){
                bool c;
                cin >>c;
                if(c){
                    m[mp(i,j)] = cnt;
                    cnt++;
                }
            }
        }
        G.resize(cnt);
        seen.resize(cnt);


        rep(i,h){
            rep(j,w){
                if(m[mp(i,j)]){
                    if(m[mp(i-1,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j-1)]);
                    }
                    if(m[mp(i,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i,j-1)]);
                    }
                    if(m[mp(i-1,j)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j)]);
                    }
                    if(m[mp(i,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i,j+1)]);
                    }
                    if(m[mp(i+1,j)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j)]);
                    }
                    if(m[mp(i+1,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j-1)]);
                    }
                    if(m[mp(i-1,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j+1)]);
                    }
                    if(m[mp(i+1,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j+1)]);
                    }

                }
            }
        }
        /*rep(i,G.size()){
            rep(j,G[i].size()){
                cout << G[i][j];
            }
            cout << endl;
        }*/

        /*rep(i,h){
            rep(j,w){
                cout << m[mp(i,j)]<< " ";
            }
            cout << endl;
        }*/
        ll ans = 0;
        rep(i,h){
            rep(j,w){
                if(m[mp(i,j)]){
                    if(seen[m[mp(i,j)]] == 0){
                        dfs(m[mp(i,j)]);
                        ans++;
                    }
                }
            }
        }
        

        cout<<ans<<endl;
    }
    return 0;
    

}