#include<iostream>
#include<algorithm>
#include<stack>
#include<string>
#include<queue>
#include<iomanip>
#include<vector>
#include<cstring>
#include<set>
using namespace std;
int n,m,cnt;
char sb[505][505];
void bfs()
{
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			if(sb[i][j]=='0'&&sb[i+1][j]=='*'&&sb[i][j+1]=='*'&&sb[i-1][j]=='*'&&sb[i][j-1]=='*')
			{
				cnt++;
			}
		}
	}
}
int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			cin >> sb[i][j];
		}
	}
	bfs();
	cout << cnt;
	return 0;
}