/*
 不, 我想亲眼看看自己选择的终点是什么样的地方.
 */
#include <cmath>
#include <cstring>

#include <algorithm>
#include <limits>
#include <functional>
#include <random>
#include <chrono>
#include <stack>
#include <bitset>
#include <numeric>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>

using ull = unsigned long long;
using ll = long long;

using namespace std;

mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());

const int P = 998244353;

int norm(int x) { return x >= P ? x - P : x; }
int reduce(int x) { return x < 0 ? x + P : x; }
int neg(int x) { return x ? P - x : 0; }
void add(int& x, int y) { if ((x += y - P) < 0) x += P; }
void sub(int& x, int y) { if ((x -= y) < 0) x += P; }
void fam(int& x, int y, int z) { x = (x + y * (ull)z) % P; }
int mpow(int x, unsigned k) {
	if (k == 0) return 1;
	int ret = mpow(x * (ull)x % P, k >> 1);
	if (k & 1) ret = ret * (ull)x % P;
	return ret;
}

char s[1005][1005];

int a[105];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);

	int N, M; cin >> N >> M; cin.ignore();
	for (int i = 0; i != N; ++i) {
		string tmp; getline(cin, tmp);
		copy(tmp.begin(), tmp.end(), s[i]);
		// cerr << s[i] << '\n';
	}
	int ans = 0;
	
	int sx = -1, sy = -1;
	for (int i = 0; i != N; ++i) {
		for (int j = 0; j != M; ++j) {
			if (s[i][j] == '+') {
				sx = i; sy = j; break;
			}
		}
		if (sx != -1) break;
	}
	auto chase = [&](int x, int y) {
		int cnt = 0;
		while (true) {
			// cerr << x << ' ' << y << ' ' << s[x][y] << '\n';
			if (s[x][y + 1] == '-') {
				a[++cnt] = 0;
				y += 4; continue;
			}
			if (s[x + 1][y] == '|') {
				++a[cnt];
				x += 3; continue;
			}
			a[++cnt] = 0; break;
		}
		a[cnt] = 0;
		for (int i = cnt - 1; i; --i) {
			a[i] += a[i + 1];
			ans += a[i];
		}
	};
	while (true) {
		if (sy && s[sx + 1][sy - 1] == '/') {
			sx += 2; sy -= 2;
		} else if (s[sx + 1][sy] == '|') {
			sx += 3; continue;
		} else break;
		chase(sx, sy);
	}
	cout << ans << '\n';

	return 0;
}