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

const int ALIVE = 1, DEAD = 2;
int h, w;
vector<vector<int>> field;
bool out_field(int i, int j) { return i < 0 || i >= h || j < 0 || j >= w; }

void dfs(int i, int j) {
    field[i][j] = DEAD;
    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;
        dfs(ni, nj);
    }
}

int main() {
    cin >> h >> w;
    field.assign(h, vector<int>(w));
    for (auto &row: field) for (auto &c: row) cin >> c;
    int cnt = 0;
    for (int si = 0; si < h; si++) for (int sj = 0; sj < w; sj++) {
        if (field[si][sj] != ALIVE) continue;
        cnt++;
        dfs(si, sj);
    }
    cout << cnt << endl;
    return 0;
}