werwer

#include <bits/stdc++.h>
using namespace std;
int g[4] = {0,0,1,-1};
int h[4] = {1,-1,0,0};
int n,m,visited[22][22];
char a[22][22];
void DFS(int nodei, int nodej){
    visited[nodei][nodej] = 1;
    for(int i = 0; i < 4; i++){
        int x = nodei + g[i];
        int y = nodej + h[i];
        if(x > 0 && x <= n && y > 0 && y <= m){
            if(!visited[x][y] && a[x][y] == '#'){
                DFS(x,y);
            }
        }
    }
}
int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }
    int say = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(!visited[i][j] && a[i][j] == '#'){
                DFS(i,j);
                say++;
            }
        }
    }
    cout << say;
}