#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
typedef long long int ll;
using namespace std;
#define INF 1234567890
#define LIMIT 1

int mmap[55][55];
int dx[] = { 0,0,1,-1,1,1,-1,-1 };
int dy[] = { -1,1,0,0,1,-1,-1,1 };
int w, h;
void dfs(int x, int y) {
	mmap[x][y] = 0;
	for (int i = 0; i < 8; i++) {
		int cx = x + dx[i];
		int cy = y + dy[i];
		if (cx < 0 || cx >= w || cy < 0 || cy >= h) continue;
		if (mmap[cx][cy]) dfs(cx, cy);
	}
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);


	cin >> h >> w;
	while (w || h) {
		int cnt = 0;
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < h; j++) {
				cin >> mmap[i][j];
			}
		}
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < h; j++) {
				if (mmap[i][j]) {
					dfs(i, j);
					cnt++;
				}
			}
		}
		cout << cnt << "\n";
		cin >> h >> w;
	}

	return 0;
}