//#include <bits/stdc++.h>
#include <iostream>
#include <time.h>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <chrono>
#include <random>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <limits>
#include <cmath>
#include <thread>

#define endl '\n'
#define X first
#define Y second
#define MAXN 1024
#define INF 1000010000
#define LLINF 1000000010000000000
#define ULLINF 10000000100000000000
#define MOD 1000000007
#define control cout<<" passed "<<'\n';

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector <int> vi;
typedef vector <long long> vll;
typedef vector <unsigned long long> vull;
typedef vector <string> vs;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}


struct edge
{
    int x,y;
    edge operator+(edge e)const
    {
        edge res;
        res.x=e.x+x;
        res.y=e.y+y;
        return res;
    }
};
edge shape[16]={{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1},{-1,0},{-1,1}};

bool used[MAXN][MAXN];
int n,m;
bool a[MAXN][MAXN];
void bfs(edge beg)
{
    used[beg.x][beg.y]=1;
    queue <edge> q;
    q.push(beg);
    while(!q.empty())
    {
        edge w=q.front();
        q.pop();
        for(int i=0;i<8;i++)
        {
            edge nb=w+shape[i];
            if(nb.x<1||nb.x>n||nb.y<1||nb.y>m)continue;
            if(used[nb.x][nb.y]==0)
            {
                bool lamp=0;
                for(int j=0;j<8;j++)
                {
                    edge e=nb+shape[j];
                    if(e.x<1||e.x>n||e.y<1||e.y>m)break;
                    if(a[e.x][e.y]==1&&e.x!=w.x&&e.y!=w.y)
                    {
                        //cout<<e.x<<" "<<e.y<<"    "<<nb.x<<" "<<nb.y<<"      "<<w.x<<" "<<w.y<<endl;
                        lamp=1;
                        break;
                    }
                }
                if(lamp=0)
                {

                    q.push(nb);
                    used[nb.x][nb.y]=1;
                }
                else
                {
                    used[nb.x][nb.y]=1;
                }
            }
        }
    }
}

int main()
{
    speed();
    #ifdef ONLINE_JUDGE
    freopen("minesweeper.in", "r", stdin);
    freopen("minesweeper.out", "w", stdout);
    #endif

    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>a[i][j];
            if(a[i][j])used[i][j]=1;
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(used[i][j]==0&&a[i][j+1]==0&&a[i+1][j+1]==0&&a[i+1][j]==0&&a[i+1][j-1]==0&&a[i][j-1]==0&&a[i-1][j-1]==0&&a[i-1][j]==0&&a[i-1][j+1]==0)
            {
                ans++;
                edge e;
                e.x=i;
                e.y=j;
                bfs(e);
            }
        }
    }
    /*for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cout<<used[i][j]<<" ";
        }cout<<endl;
    }*/
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(used[i][j]==0)
            {
                ans++;
                edge e;
                e.x=i;
                e.y=j;
                bfs(e);
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}