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 <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
 
using namespace std;
using Graph = vector<vector<int>>;

#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(a) begin(a),end(a)
 
typedef long long ll;
typedef pair<int,int> P;
const int inf=1000000007;
const ll mod=1000000007;
const double PI=3.14159265358979323846;
 
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
 
ll gcd(ll a, ll b){
  if (b==0) return a;
  else return gcd(b,a%b);
}
 
int cans(bool f){
  if(f) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}





int W,H;
vector<vector<int>> field;



void dfs(int y,int x){
  field[y][x] = 0;
  for(int i = -1; i <= 1; i++){
    for(int j = -1; j <= 1; j++){
      
      int nx,ny; 
      nx = x + i;
      ny = y + j;
      if (ny < 0 || ny >= H || nx < 0 || nx >= W || field[ny][nx] == 0) continue;
      dfs(ny,nx);
    }
  }
}

int main(){
  while(cin >> W >> H){
    if(W == 0 || H == 0) break;
    field.assign(H,vector<int>(W,0));
    rep(i,H){
      rep(j,W) cin >> field[i][j];
    }
    
    int ans = 0;
    rep(i,H){
      rep(j,W){
	if(field[i][j] == 0) continue;
	ans++;
	dfs(i,j);
      }
    }
    cout << ans << endl;
  }
}












// void dfs(int h, int w) {
//     field[h][w] = 0;

//     // 八方向を探索
//     for (int dh = -1; dh <= 1; ++dh) {
//         for (int dw = -1; dw <= 1; ++dw) {
//             int nh = h + dh, nw = w + dw;

//             // 場外アウトしたり、0 だったりはスルー
//             if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
//             if (field[nh][nw] == 0) continue;

//             // 再帰的に探索
//             dfs(nh, nw);
//         }
//     }
// }

// int main() {
//     // 入力受け取り
//     while (cin >> W >> H) {
//         if (H == 0 || W == 0) break;
//         field.assign(H, vector<int>(W, 0));
//         for (int h = 0; h < H; ++h) for (int w = 0; w < W; ++w) cin >> field[h][w];

//         // 探索開始
//         int count = 0;
//         for (int h = 0; h < H; ++h) {
//             for (int w = 0; w < W; ++w) {
//                 if (field[h][w] == 0) continue; // 残島じゃなかったらスルー
//                 dfs(h, w);
//                 ++count;
//             }
//         }
//         cout << count << endl;
//     }
// }

C++: #include<bits/stdc++.h>
using namespace std;
int w,h,c[50][50],ans;
vector<int> out;
bool dfs(int x,int y);
int main(){
  while(1){
    ans = 0;
    for(int i=0;i<50;i++){
      for(int l=0;l<50;l++){
        c[i][l] = 0;
      }
    }
    cin >> w >> h;
    if(w == 0 && h == 0){
      break;
    }
    for(int i=0;i<h;i++){
      for(int l=0;l<w;l++){
         cin >> c[l][i];
      }
    }
    for(int i=0;i<h;i++){
      for(int l=0;l<w;l++){
        if(c[l][i] == 1){
          dfs(l,i);
          ans++;
        }
      }
    }
    out.push_back(ans);
  }
  for(int i=0;i<out.size();i++){
    cout << out[i] << endl;
  }
}
bool dfs(int x,int y){
  if(x<0 || x>=w || y<0 || y>=h || c[x][y] == 0) return false;
  c[x][y] = 0;
  for(int dx=-1;dx<=1;dx++){
    for(int dy=-1;dy<=1;dy++){
      if(dfs(x+dx,y+dy)){
        return true;
      }
    }
  }
  return false;
}

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

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

int f(int x, int y){
    if(x >= w || x < 0 || y >= h || y < 0) return 0;
    if(flag[x][y] == 1 || c[x][y] == 0) return 0;
    flag[x][y] = 1;
    f(x+1,y);
    f(x-1,y);
    f(x,y+1);
    f(x,y-1);
    f(x+1,y+1);
    f(x+1,y-1);
    f(x-1,y+1);
    f(x-1,y-1);
    return 1;
}

int main(){
    do{
        int sum = 0;
        cin >> w >> h;
        if(w == 0 && h == 0) return 0;
        for(int y = 0; y < h; y++){
            for(int x = 0; x < w; x++){
                cin >> c[x][y];
                flag[x][y] = 0;
            }
        }
        for(int y = 0; y < h; y++){
            for(int x = 0; x < w; x++){
                sum += f(x,y);
            }
        }
        cout << sum << endl;
    }while(true);

    return 0;
}