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 <iostream>
#include <fstream>
#include <stdio.h>

using namespace std;

int w,h;
int c[50][50];

typedef struct Point{
    int x;
    int y;
}Point;

bool solve(Point p, int *a){
    
    int res = *a;
    if(c[p.y][p.x] == 1){
        res++;
        c[p.y][p.x] = 0;
        for(int i=-1; i<2; i++){
            for(int j=-1; j<2; j++){
                if(!(i==0 && j==0)){
                    if(0<=p.y+i && p.y+i <h && 0<=p.x+j && p.x+j <w){
                        if(c[p.y+i][p.x+j] == 1){
                        solve(Point{p.x+j,p.y+i}, &res);
                        }
                    }
                }
            }
        }
    }
    
    if(res>0)
    return true;
    
    return false;
}

int main(int argc, const char * argv[]) {
    // insert code here...
    /////////
    //write//
    /////////
    
    while(1){
        cin >> w >> h;
        
        if(w==0 && h==0)break;
        for(int i=0; i<h; i++){
            for(int j=0; j<w; j++){
                cin >> c[i][j];
            }
        }
        
        int a = 0;
        int cnt = 0;
        for(int i=0; i<h; i++){
            for(int j=0; j<w; j++){
                if(solve(Point{j,i}, &a)){
                    //cout << "x:" << j << ",y:" << i << endl;
                    cnt++;
                }
            }
        }
        
        cout << cnt << endl;
    }
    
    return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}

int w,h;
int c[55][55];

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

int main() {
    while(true) {
        cin >> w >> h;
        if(w == 0 && h == 0) break;
        rep(i,h) rep(j,w) {
            cin >> c[i][j];
        }
        int ans = 0;
        rep(i,h) rep(j,w) {
            if(c[i][j] == 1) {
                ans++;
                dfs(i,j);
            }
        }
        cout << ans << endl;
    }    
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
vector<vector<int>> C(50,vector<int>(50));
int cnt=0,w,h;

void dfs(int x,int y){
    C.at(x).at(y) = 0;
    for(int i=-1;i<2;++i){
        for(int j=-1;j<2;++j){
            int nh = x + i;
            int nw = y + j;
            if(0<=nw&&nw<w&&0<=nh&&nh<h&&C.at(nh).at(nw)==1){
            dfs(nh,nw);
            }
        }
        
    }
}

int main(){
    while(true){
        cin >> w >> h;
        if(w==0&&h==0){
            return 0;
        }
        rep(i,50){
            rep(j,50){
                C.at(i).at(j) = 0;
            }
        }
        cnt = 0;
        rep(i,h){
            rep(j,w){
                cin >> C.at(i).at(j);
            }
        }
       rep(i,h){
            rep(j,w){
                if(C.at(i).at(j)==1){
                    dfs(i,j);
                    ++cnt;
                }   
            }
        }
        cout << cnt << endl;    
    }
}

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

#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ZERO(a) memset(a,0,sizeof(a))

const int M = 55;
int w,h;
int f[M][M];
int dx[] = {1,1,1,0,0,-1,-1,-1};
int dy[] = {0,1,-1,1,-1,0,1,-1};

void dfs(int x, int y) {
    if(x == w || y == h) return ;
    f[y][x] = 0;
    rep(i,8) {
        int nx = x+dx[i], ny = y+dy[i];
        if(f[ny][nx] == 1)
            dfs(nx, ny);
    }
}

int main() {
    while(cin>>w>>h && w) {
        ZERO(f);
        rep(i,h) rep(j,w) cin >> f[i][j];

        int ans = 0;
        rep(i,h) rep(j,w) {
            if(f[i][j] == 0) continue;
            dfs(j,i);
            ans++;
        }

        cout << ans << endl;
    }

    return 0;
}