？ ？ ？ ？ ？

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;

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

char ma[2005][2005];
int ans[2005][2005];

struct point {
	int x;
	int y;
};
queue<point> q;

int main() {
	memset(ans,-1,sizeof(ans));
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i = 1; i <= n; i++) {
		scanf("%s",ma[i] + 1);
		for(int j = 1; j <= m; j++) {
			if(ma[i][j] == 'm') {
				point cur;
				cur.x = i;
				cur.y = j;
				q.push(cur);
				ans[i][j] = 0;
			}
		}
	}
	while(!q.empty()) {
		point cur = q.front();
		for(int i = 0; i < 4; i++) {
			point a;
			a.x = cur.x + dx[i];
			a.y = cur.y + dy[i];
			if(a.x > n||a.y > m)continue;
			if(ans[a.x][a.y] == -1&&ma[a.x][a.y] != '#') {
				ans[a.x][a.y] = ans[cur.x][cur.y]+1;
				q.push(a);
			}
			if(ma[a.x][a.y] == 'd') {
				cout<<ans[a.x][a.y]<<endl;
				return 0;
			}
		}
		q.pop();
	}
	cout<<"No Way!"<<endl;
	return 0;
}