#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define F first
#define S second
#define ii pair < int , int >
#define ever (;;)

const int N = 1010;

bool vis[N][N];
int n,m,movex[4]={1,-1,0,0},movey[4]={0,0,1,-1};
char a[N][N];

void dfs(int x,int y)
{
    vis[x][y] = 1;

    for(int i=0;i<4;i++)
    {
        int newx = x + movex[i];
        int newy = y + movey[i];

        if( !vis[newx][newy] && a[newx][newy] == '.' )
            dfs(newx,newy);
    }
}

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

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if( !vis[i][j] && a[i][j] == '.' )
                dfs(i,j);
}