#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

const int N = 3005, M = 6005;
int L[N][M], R[N][M], U[N][M], D[N][M], H[N][M], HR[N][M];

int bit[M];
void add(int x, int k) {
    while (x < M)
        bit[x] += k, x += x & -x;
}
ll qr(int x) {
    ll ret = 0;
    while (x) 
        ret += bit[x], x -= x & -x;
    return ret;
}
vector<int> rm[M];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int r, _c;
    cin >> r >> _c;
    int c = (_c + 1) / 2 + (r - 1);
    cin.ignore();
    for (int i = 1; i <= r; i++) {
        string s;
        getline(cin, s);
        int bs = ((i & 1) ? 0 : 2);
        int rb = i / 2 + 1;
        for (int j = rb; j <= c; j++) {
            int t = bs + (j - rb) * 4; 
            assert(SZ(s) <= t || s[t] == 'x');
            if (t + 2 < SZ(s) && s[t + 2] == '-')
                R[i][j] = 1, L[i][j + 1] = 1;
        }
        if (i == r)
            break;
        getline(cin, s);
        // H
        bs = ((i & 1) ? 1 : 3);
        for (int j = rb; j <= c; j++) {
            int t = bs + (j - rb) * 4; 
            if (t < SZ(s) && s[t] == '\\')
                H[i][j] = 1, HR[i + 1][j + 1] = 1;
        }
        // D
        bs = ((i & 1) ? -1: 1);
        for (int j = rb; j <= c; j++) {
            int t = bs + (j - rb) * 4; 
            if (t >= 0 && t < SZ(s) && s[t] == '/')
                D[i][j] = 1, U[i + 1][j] = 1;
        }
    }
    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++) {
            if (L[i][j]) L[i][j] += L[i][j - 1]; 
            if (U[i][j]) U[i][j] += U[i - 1][j]; 
            if (HR[i][j]) HR[i][j] += HR[i - 1][j - 1]; 
        }
    for (int i = r; i >= 1; i--)
        for (int j = c; j >= 1; j--) {
            if (R[i][j]) R[i][j] += R[i][j + 1]; 
            if (D[i][j]) D[i][j] += D[i + 1][j]; 
            if (H[i][j]) H[i][j] += H[i + 1][j + 1]; 
        }

    ll ans = 0;
    for (int i = 1; i <= r; i++) {
        for (int j = 1; j <= c; j++)
            rm[j].clear();
        memset(bit, 0, sizeof(bit));
        for (int j = 1; j <= c; j++) {
            ans += qr(j) - qr(j - min(L[i][j], D[i][j]) - 1);
            if (H[i][j])
                add(j, 1), rm[j + H[i][j]].pb(j);
            for (int x : rm[j])
                add(x, -1);
        }
    }
    for (int i = 1; i <= r; i++) {
        for (int j = c; j >= 1; j--)
            rm[j].clear();
        memset(bit, 0, sizeof(bit));
        for (int j = c; j >= 1; j--) {
            ans += qr(j + min(R[i][j], U[i][j])) - qr(j - 1);
            if (HR[i][j])
                add(j, 1), rm[j - HR[i][j]].pb(j);
            for (int x : rm[j])
                add(x, -1);
        }
    }
    cout << ans << endl;

    // for (int i = 1; i <= r; i++)
    //     for (int j = 1; j <= r; j++) {
    //         cerr << i << " " << j << " " << L[i][j] << " " << R[i][j] << " " << U[i][j] << " " << D[i][j] << " " << HR[i][j] << " " << H[i][j] << endl;
    //     }
       
}