#include<iostream> #include<iomanip> #include<math.h> #include<vector> #include<algorithm> #include<set> #include<map> #include<unordered_map> #include<queue> #include<stack> #include<string> #include<bitset> #include<random> #include<time.h> #define MOD 1000000007ll #define INF 1000000000ll #define EPS 1e-7 #define REP(i,m) for(long long i=0; i<(ll)m; i++) #define FOR(i,n,m) for(long long i=n; i<(ll)m; i++) #define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; } #define ALL(v) v.begin(),v.end() #define UNIQUE(v) sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); #define pb push_back using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef long double ld; ll h,w; vector<vector<int>> a(3000,vector<int>(3000)); ll dx[]={1,0,-1,0}; ll dy[]={0,1,0,-1}; int main() { ios::sync_with_stdio(false); cin.tie(0); cin>>h>>w; REP(i,h) REP(j,w) { ll hoge; cin>>hoge; a[i][j]=hoge; } ll sum=0; REP(i,h) REP(j,w) { if(a[i][j]) { bool d=true; REP(k,4) { ll nx=i+dx[k]; ll ny=j+dy[k]; if(nx>=0&&nx<h&&ny>=0&&ny<w&&a[nx][ny]==-1) d=false; } if(d) { a[i][j]=-1; sum++; } } } cout<<sum<<endl; }