#include<bits/stdc++.h>
using namespace std;
int dx[8] = {-1, 1, 0, 0, -1, 1, -1, 1};
int dy[8] = {0, 0, -1, 1, -1, -1, 1, 1};
const int N = 105;
char mp[N][N];
bool visited[N][N];
int h, w;
int col = 0;

bool judge(int x, int y)
{
	if(x > h || x < 1 || y > w || y < 1) return false;
	if(visited[x][y]) return false;
	if(mp[x][y] != 'w') return false;
	return true;
}
void bfs(int x, int y)
{
	queue<pair<int, int>> q;
	q.push({x, y});
	visited[x][y] = true;
	
	while(!q.empty())
	{
		auto ele = q.front(); q.pop();
		int xx = ele.first; int yy = ele.second;
		for(int i = 0; i < 8; i ++)
		{
			int nx = xx + dx[i]; int ny = yy + dy[i];
			if(judge(nx, ny))
			{
				q.push({nx, ny});
				visited[nx][ny] = true;
			}
		}
	}
}

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> h >> w;
	memset(visited, 0, sizeof(visited));
	for(int i = 1; i <= h; i ++)
	{
		for(int j = 1; j <= w; j ++)
...