Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	results := []int{}
	for true {
		w, h := scanInt(sc), scanInt(sc)
		if w == 0 && h == 0 {
			break
		}
		grid := make([][]int, h)
		for i := 0; i < h; i++ {
			grid[i] = make([]int, w)
			for j := 0; j < w; j++ {
				grid[i][j] = scanInt(sc)
			}
		}
		num := 0
		for i := range loop0(h) {
			for j := range loop0(w) {
				start := pos{y: i, x: j}
				if grid[start.y][start.x] == 0 {
					continue
				}
				num++
				_dfs(grid, w, h, start)
			}
		}
		results = append(results, num)
	}
	for _, v := range results {
		fmt.Println(v)
	}
	return
}

func _dfs(grid [][]int, w, h int, start pos) {
	grid[start.y][start.x] = 0
	for _, df := range []pos{
		pos{1, 0}, pos{-1, 0},
		pos{0, -1}, pos{0, 1},
		pos{1, 1}, pos{-1, -1},
		pos{-1, 1}, pos{1, -1},
	} {
		np := addPos(start, df)
		if np.y < 0 || h <= np.y || np.x < 0 || w <= np.x {
			continue
		}
		if grid[np.y][np.x] == 0 {
			continue
		}
		_dfs(grid, w, h, np)
	}
}

type pos struct{ x, y int }

func addPos(p, d pos) pos {
	return pos{
		x: p.x + d.x,
		y: p.y + d.y,
	}
}

func loop0(n int) chan int {
	return loop(0, n-1, 1)
}

func loop1(n int) chan int {
	return loop(1, n, 1)
}

func loop(s, e, d int) chan int {
	ch := make(chan int)
	go func() {
		for i := s; i <= e; i += d {
			ch <- i
		}
		close(ch)
	}()
	return ch
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

C++: #define  _USE_MATH_DEFINES
#define  _USE_MATH_DEFINES

#define  rep(i, n) for(int i = 0; i < n; i++)
#define  repx(i, a, n) for(int i = a; i < n; i++)
#define  loop while(1)
#define  lli long long int
#define  aryout(ary) rep(i, ary.size()) cout << ary[i] << (i < ary.size() - 1 ? " " : "\n");
 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <utility>
#include <set>

using namespace std;

void dfs (vector<vector<int>> &umi, int h, int w, int i, int j) {
  umi[i][j] = 2;
  for (int di = -1; di <= 1; di++)
    for (int dj = -1; dj <= 1; dj++)
      if (umi[i + di][j + dj] == 1)
        dfs (umi, h, w, i + di, j + dj);
}

int bfs (vector<vector<int>> &umi, int h, int w) {
  int cnt = 0;
  stack<vector<int>> gnd;
  vector<int> tmp0(2, 0);
  vector<int> tmp1(2, 0);

  repx (i, 1, h + 1) repx (j, 1, w + 1) {
    if (umi[i][j] == 1) {
      umi[i][j] = 2;
      cnt += 1;
      tmp0[0] = i; tmp0[1] = j;
      gnd.push(tmp0);

      while (gnd.size() > 0) {
        tmp0[0] = gnd.top()[0];
        tmp0[1] = gnd.top()[1];
        gnd.pop();

        //cout << "cnt: " << cnt << endl;
        //repx (i, 0, h + 2) repx (j, 0, w + 2)
          //cout << umi[i][j] << (j < w + 1 ? " " : "\n");

        umi[tmp0[0]][tmp0[1]] = 2;
        for (int di = -1; di <= 1; di++) {
          for (int dj = -1; dj <= 1; dj++) {
            tmp1[0] = tmp0[0] + di; tmp1[1] = tmp0[1] + dj;
            if (umi[tmp1[0]][tmp1[1]] == 1) {
              gnd.push(tmp1);
              umi[tmp1[0]][tmp1[1]] = 2;
              //cout << tmp1[0] << " " << tmp1[1] << " (" << umi[tmp1[0]][tmp1[1]] << ") " <<  "has pushed." << endl;
            }
          }
        }
      }
    }
  }
  return cnt;
}


int main() {

  int w, h;
  
  loop {
    cin >> w >> h;
    if (w + h == 0) break;

    vector<vector<int>> umi(h + 2, vector<int>(w + 2, 0));
    rep (i, h) rep (j, w) cin >> umi[i + 1][j + 1];

    /*
    int cnt_by_DFS = 0;
    repx (i, 1, h + 1) repx (j, 1, w + 1) {
      if (umi[i][j] == 1) {
        cnt_by_DFS += 1;
        dfs (umi, h, w, i, j);
      }
    }
    cout << cnt_by_DFS << endl;
    */
    cout << bfs (umi, h, w) << endl;
  }

  return 0;
}