/*
TASK: tab
LANG: C++
*/
#include<iostream>
using namespace std;
int svl,sv[10001][2],n,m;
char a[101][101];
void searchs(int x,int y)
{
    a[x][y]='2';
    sv[++svl][0]=x;
    sv[svl][1]=y;
    if(a[x-1][y]=='1'&&x-1>=0) searchs(x-1,y);
    if(a[x][y-1]=='1'&&y-1>=0) searchs(x,y-1);
    if(a[x+1][y]=='1'&&x+1<n) searchs(x+1,y);
    if(a[x][y+1]=='1'&&y+1<m) searchs(x,y+1);
    return;
}
int main()
{
    int i,j;
    cin>>n>>m;
    for(i=0;i<n;i++)
    cin>>a[i];
    searchs(0,0);
    for(i=0;i<n;i++)
    for(j=0;j<m;j++)
    if(a[i][j]=='2') a[i][j]='1';
    int br=0;
    for(i=0;i<=n;i++)
    for(j=0;j<=m;j++)
    {
        int o=0;
        bool f=1;
        while(f==1&&o<=svl)
        {
            if(a[sv[o][0]+i][sv[o][1]+j]!='1'||sv[o][0]+i>n||sv[o][1]+j>m) f=0;
            o++;
        }
        if(f==1) br++;
    }
    cout<<br<<'\n';
    return 0;
}

        
    
