#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
#include <map>
using namespace std;

int n, m;
int a[1001][1001];

bool visited[1001][1001];
int dx[8] = { 1,1,1,-1,-1,-1,0,0 };
int dy[8] = { 1,-1,0,1,-1,0,1,-1 };

const int MOD = (int)(1e9 + 7);

int i_max = 0, i_min = INT_MAX, j_max = 0, j_min = INT_MAX;

int cnt = 0;

void update(int i, int j) {
    a[i][j] = 0;

    i_max = max(i_max, i);
    i_min = min(i_min, i);

    j_max = max(j_max, j);
    j_min = min(j_min, j);
}

void dfs(int i, int j) {
    update(i, j);

    cnt++;

    for (int k = 0;k < 8;k++) {
        int ni = dx[k] + i;
        int nj = dy[k] + j;

        if (ni >= 0 && ni < n && nj >= 0 && nj < m && a[ni][nj] == 1) {
            dfs(ni, nj);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;

    int c = 0;

    vector<int> v;
    for (int i = 0;i < n;i++) {
        for (int j = 0;j < m;j++) {
            cin >> a[i][j];
        }
    }

    for (int i = 0;i < n;i++) {
        for (int j = 0;j < m;j++) {
            if (a[i][j]) {
                i_max = 0, i_min = INT_MAX, j_max = 0, j_min = INT_MAX, cnt = 0;
                dfs(i, j);

                int width = j_max - j_min + 1;
                int height = i_max - i_min + 1;

                if (width * height == cnt) {
                    c++;
                }
            }
        }
    }
    cout << c;
    return 0;
}