#include <bits/stdc++.h>
using namespace std;

const int maxn = 1002;
char s[maxn][maxn];
bool vis[maxn][maxn];
int n, m;

int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};

int dfs(int x, int y) {
    vis[x][y] = 1;
    int ans = 0;
    for (int i=0; i<4; ++i) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx < 0 || ny < 0) continue;
        if (nx > n + 1 || ny > m + 1) continue;
        if (s[nx][ny] == '1') ans += 1;
        else if (!vis[nx][ny]) ans += dfs(nx, ny);
    }
    return ans;
}

int main() {
    scanf("%d%d", &n, &m);
    memset(s, '0', sizeof s);
    for (int i=1; i<=n; ++i) {
        scanf("%s", s[i]+1);
        s[i][m+1] = '0';
    }
    cout << dfs(0, 0) << '\n';
    return 0;
}