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<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)

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

void saiki(int y,int x){
	if(y<0 || x<0 || y>=h || x>=w)return;
	if(masu[y][x]==0)return;
	masu[y][x]=0;
	
	int dx[]={0,1,0,-1,-1,-1,1,1};
	int dy[]={1,0,-1,0,1,-1,1,-1};
	
	rep(i,8){
		saiki(y+dy[i],x+dx[i]);
	}
}

int main(){
	
	A:
	cin>>w>>h;
	if(w==0 && h==0)return 0;
	
	rep(i,h){
		rep(j,w){
			cin>>masu[i][j];
		}
	}
	
	int count = 0;
	rep(i,h){
		rep(j,w){
			if(masu[i][j]==1){
				count++;
				saiki(i,j);
			}
		}
	}
	printf("%d\n",count);
	
	goto A;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <sstream>
#include <numeric>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>

///////////////////////////////////////////////////////////////
// namespace
///////////////////////////////////////////////////////////////
using namespace std;
// namespace mp = boost::multiprecision;

///////////////////////////////////////////////////////////////
// types
///////////////////////////////////////////////////////////////
using pii = pair<int, int>;
using ll = long long int;
using ld = long double;
// using mpi = mp::cpp_int;
// using mpf = mp::number<mp::cpp_dec_float<1024>>;

///////////////////////////////////////////////////////////////
// mod https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
///////////////////////////////////////////////////////////////
// ll MOD = 1000000007;
// ll mod(long long val) {
//     long long res = val % MOD;
//     if (res < 0) res += MOD;
//     return res;
// }
// ll modinv(ll a) {
//     ll b = MOD, u = 1, v = 0;
//     while (b) {
//         ll t = a / b;
//         a -= t * b; swap(a, b);
//         u -= t * v; swap(u, v);
//     }
//     u %= MOD;
//     if (u < 0) u += MOD;
//     return u;
// }

int w, h;
vector<vector<int>> c;

bool dfs(int i, int j) {
    if (c[i][j] == 0) return false;
    c[i][j] = 0;
    if (i - 1 >= 0) dfs(i - 1, j);
    if (i + 1 < h) dfs(i + 1, j);
    if (j - 1 >= 0) dfs(i, j - 1);
    if (j + 1 < w) dfs(i, j + 1);
    if (i - 1 >= 0 && j - 1 >= 0) dfs(i - 1, j - 1);
    if (i - 1 >= 0 && j + 1 < w) dfs(i - 1, j + 1);
    if (i + 1 < h && j + 1 < w) dfs(i + 1, j + 1);
    if (i + 1 < h && j - 1 >= 0) dfs(i + 1, j - 1);
    return true;
}

bool solve() {
    cin >> w >> h;
    if (w == 0 && h == 0) return false;
    c = vector<vector<int>>(h, vector<int>(w));
    for (int i = 0; i < h; ++i) {
        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) {
            ans += dfs(i, j);
        }
    }
    cout << ans << endl;
    return true;
}

int main() {
    while (solve());
    return 0;
}

C++: #include<bits/stdc++.h>
/*
#include<iostream>
#include<vector>
#include<algorithm>
 */
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
#define FIX(a) fixed << setprecision(a)

int h, w;
bool c[50][50];
int cnt;
int reached[50][50];
void dfs(int y, int x) {
    rep3(i, -1, 2) rep3(j, -1, 2) {
        if ((i | j) == 0) continue;
        int ny = y + i;
        int nx = x + j;
        if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
        if (reached[ny][nx] == 1 || c[ny][nx] == 0) continue;
        reached[ny][nx] = 1;
        dfs(ny, nx);
    }
}
int main() {
    while (cin >> w && w) {
        cin >> h;
        fill_n(*reached, 50 * 50, 0);
        rep(i, h) rep(j, w) cin >> c[i][j];
        cnt = 0;
        rep(i, h) rep(j, w) {
            if (c[i][j] == 0 || reached[i][j] == 1) continue;
            reached[i][j] = 1;
            cnt++;
            dfs(i, j);
            // rep(k, h) { rep(l, w) cout << reached[k][l] << " "; cout << endl; }
        }
        out(cnt);
    }
}