#include <bits/stdc++.h>
using namespace std;
#define ls u << 1
#define rs u << 1 | 1
#define LL long long
#define int long long
#define PII pair <int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define i128 __int128
#define pcnt(x) __builtin_popcount(x)
#define mem(a,goal) memset(a, (goal), sizeof(a))
#define rep(x,start,end) for(int x = (start) - ((start) > (end)); x != (end) - ((start) > (end)); ((start) < (end) ? x ++ : x --))
#define aLL(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
const int INF = 998244353;
const int mod = 1e9 + 7;
const int N = 1010;
char g[N][N];
int st[N][N];
int dx[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[] = {1, 1, 0, -1, -1, -1, 0, 1};
int n, m;
void bfs(int a, int b)
{
    st[a][b] = 1;
    queue<PII> q;
    q.push({a, b});
    while(q.size())
    {
        PII t = q.front();
        q.pop();
        for(int i = 0; i < 8; ++ i)
        {
            int x = t.first + dx[i];
            int y = t.second + dy[i];
            if(x >= 0 && x < n && y >= 0 && y < m && !st[x][y] && g[x][y] == 'W')
            {
                q.push({x, y});
                st[x][y] = 1;
            }
        }
    }
}
void solve()
{
    int res = 0;
    cin >> n >> m;
    for(int i = 0; i < n; ++ i)
        for(int j = 0; j < m; ++ j)
            cin >> g[i][j];

    for(int i = 0; i < n; ++ i)
        for(int j = 0; j < m; ++ j)
        {
            if(g[i][j] == 'W' && !st[i][j])
            {
                bfs(i, j);
                ++ res;
            }
        }
    cout << res << '\n';
}

signed main()
{
    int t = 1;
    while (t --) solve();
    return 0;
}