#include<iostream>
#include<cstdio>
using namespace std;
const int MAX=0x3f; 
int n,m,sx,sy,ex,ey;
char map[2005][2005];
bool vis[2005][2005];
int minn=MAX;
void dfs(int x,int y,int d){
	if(x==ex&&y==ey){
		minn = min(minn,d);
		return;
	}
	if(x<1||x>n||y<1||y>m||vis[x][y] == 1||map[x][y] == '#'){
		return;
	}
	vis[x][y] = 1;
	dfs(x+1,y,d+1);
	dfs(x,y+1,d+1);
	dfs(x-1,y,d+1);
	dfs(x,y-1,d+1);
	vis[x][y] = 0;
}
int main(){
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>map[i][j];
			if(map[i][j] == 'd') sx= i,sy=j;
			else if(map[i][j] == 'm') ex= i,ey=j;
		}
	}
	dfs(sx,sy,0);
	if(minn == MAX) printf("No Way!");
	else printf("%d",minn);
	return 0;
}