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++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<bitset>
#define ld long double
#define ll long long int
#define ull unsigned long long int
#define rep(i,n) for(i=0;i<n;i++)
#define fin(ans) cout<<(ans)<<endl
#define INF INT_MAX
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define vvc vector<vector<char> >
#define vvs vector<vector<string> >
#define P 1000000007
using namespace std;
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;}
const long long LLINF=1LL<<60;
//set<int>::iterator it;
//|\_
//g++ -std=c++1z temp.cpp
//./a.out

vvi v(50,vi(50,-2));

bool dfs(int x,int y,int count,int h,int w){
    
    if(v[y][x]>=0)return false;
    v[y][x]=count;
    bool t=true;
    if(x+1<w&&v[y][x+1]==-1){
        t=dfs(x+1,y,count,h,w);
    }
    if(x-1>=0&&v[y][x-1]==-1){
        t=dfs(x-1,y,count,h,w);
    }
    if(y+1<h&&v[y+1][x]==-1){
        t=dfs(x,y+1,count,h,w);
    }
    if(y-1>=0&&v[y-1][x]==-1){
        t=dfs(x,y-1,count,h,w);
    }///////
    if(x+1<w&&y+1<h&&v[y+1][x+1]==-1){
        t=dfs(x+1,y+1,count,h,w);
    }
    if(x-1>=0&&y-1>=0&&v[y-1][x-1]==-1){
        t=dfs(x-1,y-1,count,h,w);
    }
    if(y+1<h&&x-1>=0&&v[y+1][x-1]==-1){
        t=dfs(x-1,y+1,count,h,w);
    }
    if(y-1>=0&&x+1<w&&v[y-1][x+1]==-1){
        t=dfs(x+1,y-1,count,h,w);
    }
    if(t) return true;
    else return false;
}

int main(void){ios::sync_with_stdio(false);cin.tie(0);
//////////////////////////////////////////////////////
    int w,h,i,j;
    while(1){
        cin>>w>>h;
        if(w==0&&h==0)break;
        int count=1,x,y;
        rep(i,50)rep(j,50)v[i][j]=-2;
        rep(i,h)rep(j,w){
            cin>>v[i][j];
            v[i][j]*=-1;
        }
        bool c;
        for(y=0;y<h;y++){
            for(x=0;x<w;x++){
                c=dfs(x,y,count,h,w);
                if(c)count++;
            }
        }
        set<int> s;
        for(y=0;y<h;y++){
            for(x=0;x<w;x++){
                if(v[y][x]>0)s.insert(v[y][x]);
            }
        }
        cout<<s.size()<<endl;
        /*
        for(y=0;y<h;y++){
            for(x=0;x<w;x++){
                cout<<v[y][x]<<" ";
            }
            cout<<endl;
        }*/
    }
    

//////////////////////////////////////////////////////
return 0;}