#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

struct DSU
{
	int n;
	VI p, sz;
	
	DSU(int _n = 0) 
	{
		n = _n;
		p.resize(n);
		iota(ALL(p), 0);
		sz.assign(n, 1);
	}
	int find(int v)
	{
		if (v == p[v])
			return v;
		return p[v] = find(p[v]);
	}
	bool unite(int u, int v)
	{
		u = find(u);
		v = find(v);
		if (u == v) 
			return false;
		if (sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		return true;
	}
};


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	DSU d(n * m);
	vector<string> v(n);
	FOR (i, 0, n)
		cin >> v[i];
	int ans = 0;
	FOR (i, 0, n)
	{
		FOR (j, 0, m)
		{
			if (i + 1 < n && j + 1 < m &&
				v[i][j] == '/' && v[i][j + 1] == '\\' &&
				v[i + 1][j] == '\\' && v[i + 1][j + 1] == '/')
				ans++;
			if (v[i][j] != '.')
				continue;
			FOR (dx, -1, 2)
			{
				FOR (dy, -1, 2)
				{
					int ni = i + dx;
					int nj = j + dy;
					if (0 <= ni && ni < n && 0 <= nj && nj < m &&
						v[ni][nj] == '.' && abs(dx) + abs(dy) == 1)
						d.unite(i * m + j, ni * m + nj);
				}
			}
			if (i > 0 && j > 0 && v[i - 1][j - 1] == '.' && v[i - 1][j] != '/')
				d.unite(i * m + j, i * m + j - m - 1);
			if (i > 0 && j + 1 < m && v[i - 1][j + 1] == '.' && v[i - 1][j] != '\\')
				d.unite(i * m + j, i * m + j - m + 1);
			if (i + 1 < n && j > 0 && v[i + 1][j - 1] == '.' && v[i + 1][j] != '\\')
				d.unite(i * m + j, i * m + j + m - 1);
			if (i + 1 < n && j + 1 < m && v[i + 1][j + 1] == '.' && v[i + 1][j] != '/')
				d.unite(i * m + j, i * m + j + m + 1);
		}
	}
	set<int> border;
	set<int> comps;
	FOR (i, 0, n)
	{
		FOR (j, 0, m)
		{
			if ((i == 0 || j == 0 || i + 1 == n || j + 1 == m) && v[i][j] == '.')
				border.insert(d.find(i * m + j));
			if (v[i][j] == '.')
				comps.insert(d.find(i * m + j));
		}
	}
	cout << ans + SZ(comps) - SZ(border) << '\n';
		
	
	
	return 0;
}