#include <bits/stdc++.h>
using namespace std;
const char el = '\n';
typedef long long ll;
char get(vector<string> &s, int i, int j) {
  if (i >= s.size() || i < 0) return ' ';
  if (j >= s[0].size() || j < 0) return ' ';
  return s[i][j];
}
int dfs(vector<string> &s, int i, int j, vector<pair<int, int>> &res) {
  if (get(s, i, j) != '+') return 0;
  s[i][j] = '#';
  res.push_back({i, j});
  int ans = 0, tmp = 1;
  for (auto x : {i, i - 3})
    for (auto y : {j, j + 4}) {
      ans += dfs(s, x, y, res);
      auto ch = get(s, x, y);
      if (ch != '+' && ch != '#') tmp = 0;
    }
  return ans + tmp;
}
int solve(vector<string> s) {
  bool flg = false;
  for (auto &v : s)
    for (auto ch : v) flg = flg || ch == '/';
  if (!flg) return 0;
  vector<pair<int, int>> a;
  int res = dfs(s, s.size() - 1, 0, a);
  for (auto &[x, y] : a)
    s[x][y] = ' ', s[x - 2][y + 2] = '+', s[x - 1][y + 1] = ' ';
  for (auto &v : s) v.erase(v.begin(), v.begin() + 2);
  s.erase(s.end() - 2, s.end());
  return res + solve(s);
}
int main() {
  cout << setprecision(15);
  int n, m;
  cin >> n >> m;
  vector<string> a(n);
  for (auto &v : a) {
    getchar();
    v.resize(m);
    for (auto &ch : v) ch = getchar();
  }
  cout << solve(a) << el;
  return 0;
}