#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;

int main() {
    const int ALIVE = 1, DEAD = 2;
    int h, w; cin >> h >> w;
    vector<vector<int>> field(h, vector<int>(w));
    for (auto &row: field) for (auto &c: row) cin >> c;
    int cnt = 0;
    auto out_field = [&](int i, int j) { return i < 0 || i >= h || j < 0 || j >= w; };
    for (int si = 0; si < h; si++) for (int sj = 0; sj < w; sj++) {
        if (field[si][sj] != ALIVE) continue;
        cnt++;
        queue<pair<int, int>> que;
        que.emplace(si, sj); field[si][sj] = DEAD;
        while (!que.empty()) {
            int i, j;
            tie(i, j) = que.front(); que.pop();
            for (int di: {-1, 0, 1}) for (int dj: {-1, 0, 1}) {
                if (di * di + dj * dj != 1) continue;
                int ni = i + di, nj = j + dj;
                if (out_field(ni, nj) || field[ni][nj] != ALIVE) continue;
                que.emplace(ni, nj); field[ni][nj] = DEAD;
            }
        }
    }
    cout << cnt << endl;
    return 0;
}