#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define len(x) ((int)(x).length())
#define endl "\n"

struct UnionFind {
    UnionFind() {}
    UnionFind(int n) {
        resize(n);
    }
    
    void resize(int n) {
        par.resize(n, -1);
    }
    
    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }
    
    bool merge(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (par[rx] > par[ry]) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }
    
    bool is_same(int x, int y) {
        return (root(x) == root(y));
    }
    
    int size(int x) {
        return -par[root(x)];
    }
    
private:
    vector<int> par;
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const int d[2][2] = {{0, 1}, {1, 0}};
    int h, w;
    cin >> h >> w;
    vector<vector<int>> a(h, vector<int>(w));
    rep(i, h) rep(j, w) cin >> a[i][j];
    UnionFind uf(h * w);
    rep(y, h) {
        rep(x, w) {
            if (a[y][x] == 0) continue;
            rep(i, 2) {
                int nx = x + d[i][0];
                int ny = y + d[i][1];
                if ((nx < 0) || (nx >= w) || (ny < 0) || (ny >= h)) continue;
                if (a[ny][nx] == 0) continue;
                uf.merge(y * w + x, ny * w + nx);
            }
        }
    }
    set<int> grp;
    rep(y, h) {
        rep(x, w) {
            if (a[y][x] == 0) continue;
            grp.insert(uf.root(y * w + x));
        }
    }
    cout << sz(grp) << endl;
    return 0;
}