// HoaiNam
#include <bits/stdc++.h>
#define endl "\n"
#define int long long
#define all(x) x.begin(), x.end()
#define NAME ""
using namespace std;

const int N = 1e3 + 1;
const int INF = 1e9;
const int mod = 1e9 + 7;

int dx[] = { -1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

char A[N][N];
bool vis[N][N];
int n, m;

void dfs(pair<int, int> start) {
    auto [u, v] = start;
    vis[u][v] = true;
    for (int i = 0; i < 4; ++i) {
        int x = u + dx[i];
        int y = v + dy[i];
        if (x >= 1 && x <= n && y >= 1 && y <= m && !vis[x][y] && A[x][y] == '#') {
            dfs({x, y});
        }
    }
}

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

    if (fopen(NAME".INP", "r")) {
        freopen(NAME".INP", "r", stdin);
        freopen(NAME".OUT", "w", stdout);
    }

    cin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> A[i][j];
        }
    }

    int cnt = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (!vis[i][j] && A[i][j] == '#') {
                dfs({i, j});
                cnt++;
            }
        }
    }
    cout << cnt << endl;

    // HoaiNam
}