Go: package main

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

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}

func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}

func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}

func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}

func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}

func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0

	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	for solve(scanner, writer) {

	}
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}

func solve(scanner *bufio.Scanner, writer *bufio.Writer) bool {
	sol := solver{}
	sol.w = getNextInt(scanner)
	sol.h = getNextInt(scanner)
	if sol.w == 0 && sol.h == 0 {
		return false
	}
	sol.land = makeInts(sol.h, sol.w)
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			sol.land[y][x] = getNextInt(scanner)
		}
	}
	ans := 0
	for y := 0; y < sol.h; y++ {
		for x := 0; x < sol.w; x++ {
			if sol.land[y][x] == 0 {
				continue
			}
			ans++
			sol.dfs(y, x)
		}
	}
	fmt.Fprintln(writer, ans)
	return true
}

type solver struct {
	w, h int
	land [][]int
}

func (sol *solver) dfs(y, x int) {
	if y < 0 {
		return
	}
	if y >= sol.h {
		return
	}
	if x < 0 {
		return
	}
	if x >= sol.w {
		return
	}
	if sol.land[y][x] == 0 {
		return
	}
	sol.land[y][x] = 0
	dy := [8]int{-1, -1, -1, 0, 0, 1, 1, 1}
	dx := [8]int{-1, 0, 1, -1, 1, -1, 0, 1}
	for i := 0; i < 8; i++ {
		sol.dfs(y+dy[i], x+dx[i])
	}
}
func makeInts(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(pair<int, int> a, pair<int, int> b) {
    if(a.first != b.first){
        return a.first < b.first;
        
    }else{
        return a.second < b.second;
    }
}
// 入力

vector<vector<ll> > G;
vector<bool> seen;


//ll fcnt=1;
void dfs(ll v){
    seen[v] = 1;

    rep(i,G[v].size()){
        if(seen[G[v][i]] == 0){
            dfs(G[v][i]);
        }
    }

}

int main() {
    
    while(1){
        G.clear();
        seen.clear();
        ll w,h;
    
        cin >> w>>h;
        if(w==0 &&h==0) break;
        ll cnt=1;
        map<pair<ll,ll>,ll> m;
        
        rep(i,h){
            rep(j,w){
                bool c;
                cin >>c;
                if(c){
                    m[mp(i,j)] = cnt;
                    cnt++;
                }
            }
        }
        G.resize(cnt);
        seen.resize(cnt);


        rep(i,h){
            rep(j,w){
                if(m[mp(i,j)]){
                    if(m[mp(i-1,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j-1)]);
                    }
                    if(m[mp(i,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i,j-1)]);
                    }
                    if(m[mp(i-1,j)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j)]);
                    }
                    if(m[mp(i,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i,j+1)]);
                    }
                    if(m[mp(i+1,j)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j)]);
                    }
                    if(m[mp(i+1,j-1)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j-1)]);
                    }
                    if(m[mp(i-1,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i-1,j+1)]);
                    }
                    if(m[mp(i+1,j+1)]){
                        G[m[mp(i,j)]].pb(m[mp(i+1,j+1)]);
                    }

                }
            }
        }
        /*rep(i,G.size()){
            rep(j,G[i].size()){
                cout << G[i][j];
            }
            cout << endl;
        }*/

        /*rep(i,h){
            rep(j,w){
                cout << m[mp(i,j)]<< " ";
            }
            cout << endl;
        }*/
        ll ans = 0;
        rep(i,h){
            rep(j,w){
                if(m[mp(i,j)]){
                    if(seen[m[mp(i,j)]] == 0){
                        dfs(m[mp(i,j)]);
                        ans++;
                    }
                }
            }
        }
        

        cout<<ans<<endl;
    }
    return 0;
    

}

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

#define rep(i, n) for(auto i=0; i != n; ++i)
#define REP(i, k, n) for(auto i=k; i != n; ++i)
#define rrep(i, n) for(auto i=n; i != 0; --i)
#define RREP(i, n, k) for(auto i=n; i != k; --i)


int sea[60][60];
int w,h;
void dfs(int x, int y){
    int dx[] = {0, 1, -1};
    int dy[] = {0, 1, -1};

    if(sea[x][y] == -1) return ;

    if(sea[x][y] == 1){
        sea[x][y] = -1;
    }

    for(int xx=-1; xx<=1; xx++){
        for(int yy=-1; yy<=1; yy++){
            if(xx==0 && yy==0){
                continue;
            }

            if(sea[x + xx][y + yy] == 1){
                dfs(x+xx, y+yy);

            }

        }
    }



}

int main (){
    while (true){
        cin>>w>>h;
        if(w==0 && h==0){ break;}
        rep(i, 60){
            rep(j,60){
                sea[i][j] = -1;
            }
        }

        rep(i, h){
            rep(j,w){
                cin>>sea[i+1][j+1];
            }
        }


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

        cout<<ans<<endl;

    }

}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int w, h;

void dfs(int x, int y, vector<vector<int>> &c) {
  if (x < 0 || y < 0 || x >= h || y >= w) {
    return;
  }
  if (c[x][y] == 0) {
    return;  // umi or seeen
  }
  c[x][y] = 0;

  for (int i = 0; i < 8; i++) {
    dfs(x + dx[i], y + dy[i], c);
  }
}
int main() {
  vector<int> ans;
  while (1) {
    cin >> w >> h;
    if (w == 0 && h == 0) {
      break;
    }
    vector<vector<int>> c(h, vector<int>(w));

    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        cin >> c[i][j];
      }
    }
    int count = 0;
    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        if (c[i][j] == 1) {
          dfs(i, j, c);
          count++;
        }
      }
    }
    ans.push_back(count);
  }
  for (auto it = ans.begin(); it != ans.end(); it++) {
    cout << *it << endl;
  }
}