#include <iostream>
#include <cstring>
using namespace std;
int n, m, _3bv = 0;
int num[1002][1002];
int xx[] = { 1, 1, 1, -1, -1, -1, 0, 0 };
int yy[] = { 0, 1, -1, 0, 1, -1, 1, -1 };
bool vis[1002][1002];

void dfs(int x, int y)
{
	for (int i = 0; i <= 7; i++)
	{
		int nx, ny;
		nx = x + xx[i], ny = y + yy[i];
		if (nx < 1 || nx > n || ny < 1 || ny > m || num[nx][ny] != 0 || vis[nx][ny])
		{
			continue;
		}
		vis[nx][ny] = 1;
		dfs(nx, ny);
	}
}
//1存雷，2存数字，0是空地
int main()
{
	cin >> n >> m;
	memset(num, 0, sizeof(num));
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin >> num[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (num[i][j] == 1)
			{
				for (int k = 0; k <= 7; k++)
				{
					int nx, ny;
					nx = i + xx[k], ny = j + yy[k];
					if(num[nx][ny]!=1&&(nx>=1&&nx<=n)&&ny>=1&&ny<=m)
					num[nx][ny] = 2;
				}
			}
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			if (num[i][j] !=2)
				continue;
			bool is_ = true;
			for (int k = 0; k <= 7; k++)
			{
				int nx, ny;
				nx = i + xx[k], ny = j + yy[k];
				if (nx < 1 || nx > n || ny < 1 || ny > m)
				{
					continue;
				}
				if (num[nx][ny] == 0)
				{
					is_ = false;
					break;
				}
			}
			if (is_)
				_3bv++;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (num[i][j] == 0 && !vis[i][j])
			{
				dfs(i, j);
				_3bv++;
			}
		}
	}
	cout << _3bv;
	return 0;
}