/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

/*

8 20
/\/\/\/\/\/\/\/\/\/\
\../\.\/..\.\/\/\/\/
/./\../././\.\/\/\/\
\/\/\.\/\\./\/..\../
/\/./\/\/.\..\/\/\.\
\.\.././\.\/\/./\.\/
/.../\../..\/./.../\
\/\/\/\/\/\/\/\/\/\/

14 16
......./\.......
....../..\......
...../....\.....
..../...../.....
....\..../......
.....\/\.\......
......./..\.....
....../.../.....
....\.\../......
..../..\/.......
....\/\/........
................
................
................
*/
int n,m;
vector<string> a;
vector<vector<bool>> vis;
vector<vector<int>> M;

bool is_tiny_room(int x, int y)
{
	return x<n-1 && y<m-1 && a[x][y]=='/' && a[x][y+1]=='\\' && a[x+1][y]== '\\' && a[x+1][y+1]=='/';
}


bool dfs(int x, int y, int marker)
{
	vis[x][y]=true;
	M[x][y]=marker;
	bool res=true;
	if(x==0 || y==0 || x==n-1 || y==m-1)
		res=false;
	FOR(dx,-1,2)
	{
		FOR(dy,-1,2)
		{
			if(x+dx >=0 && x+dx<n && y+dy>=0 && y+dy<m && !vis[x+dx][y+dy] && a[x+dx][y+dy]=='.')
			{
				if(abs(dx)+abs(dy)==2)
				{
					if(abs(dx+dy)==2)
					{
						if(!(a[x+dx][y]=='/' && a[x][y+dy]=='/'))
							res = dfs(x+dx,y+dy,marker) && res;
					}
					else
					{
						if(!(a[x+dx][y]=='\\' && a[x][y+dy]=='\\'))
							res = dfs(x+dx,y+dy,marker) && res;
					}
				}
				else
					res = dfs(x+dx,y+dy,marker) && res;
			}
		}
	}
	return res;
}

int solve()
{
	if(!(cin>>n>>m))return 1;
	a=vector<string>(n);
	vis=vector<vector<bool>>(n, vector<bool>(m,false));
	M=vector<vector<int>>(n, vector<int>(m,0));
	FOR(i,0,n)
		cin>>a[i];
	int ctr=0;
	int marker=0;
	FOR(i,0,n)
	{
		FOR(j,0,m)
		{
			if(is_tiny_room(i,j))
				++ctr;
			if(a[i][j]=='.')
			{
				if(!vis[i][j])
				{
					ctr += dfs(i,j, ++marker);
				}
			}
		}
	}
	//FOR(i,0,n)
	//{
		//FOR(j,0,m)
		//{
			//cout<<M[i][j]<<' ';
		//}
		//cout<<'\n';
	//}
	cout<<ctr<<'\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}