#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
  ll h,w;cin >> h >> w;
  vvl g(h,vl(w));
  rep(i,h)rep(j,w)cin >> g[i][j];
  auto f=[&](auto &self,ll x,ll y)->void {
    //cout << x <<" " << y << endl;
    g[x][y]=0;
    rep(k,4){
      ll nx=dx[k]+x,ny=dy[k]+y;
      if(nx<0||ny<0||nx>=h||ny>=w)continue;
      if(g[nx][ny]==0)continue;
      self(self,nx,ny);
    }
  };
  ll ans=0;
  rep(i,h)rep(j,w){
    if(g[i][j]){
      ans++;f(f,i,j);
    }
  }
  cout << ans << endl;
}