#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <numeric>
#include <vector>
#include <climits>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

int main() {
    int h, w;
    cin >> h >> w;

    vector table(h, vector<int>(w));

    for(auto& i : table) for(auto&j : i) cin >> j;

    int ans = 0;

    rep(i, h) {
        rep(j, w) {
            if(table[i][j]) {
                ans++;
                queue<pair<int,int>> que;
                que.emplace(i, j);
                while(!que.empty()) {
                    auto [now_i, now_j] = que.front();
                    que.pop();
                    table[now_i][now_j] = 0;
                    rep(di, -1, 2) {
                        rep(dj, -1, 2) {
                            if(abs(di) + abs(dj) > 1) continue;
                            if(di == 0 && dj == 0) continue;
                            int nex_i = now_i + di;
                            int nex_j = now_j + dj;
                            if(nex_i >= 0 && nex_i < h && nex_j >= 0 && nex_j < w) {
                                if(table[nex_i][nex_j]) que.emplace(nex_i, nex_j);
                            }
                        }
                    }
                }
            }
        }
    }

    cout << ans << endl;

    return 0;
}