#include <iostream>

#include <cstring>

#include <cstdio>

#include <queue>

using namespace std;

int n, m, sx, sy, ex, ey;

char map[2003][2003]; bool vis[2003][2003], mark = false;

struct node{int x, y, tot;};

queue<node> P;

int dx[10] = {1, 0, -1, 0};

int dy[10] = {0, 1, 0, -1};

void bfs(node now) {

	while(!P.empty()) {

		now = P.front();

		P.pop();

		int x = now.x, y = now.y, tot = now.tot;

		if(x == ex&&y == ey) {printf("%d\n", tot); mark = true; return ;}

		for(int i=0; i<4; i++) {

			int xx = dx[i]+x, yy = dy[i]+y;

			if(xx <= n&&yy <= m&&xx > 0&&yy > 0&&map[xx][yy] != '#'&&!vis[xx][yy]) {

				vis[xx][yy] = 1;

				P.push((node) {xx, yy, tot+1});

			}

		}

	}

}

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] == 'm')sx = i, sy = j; if(map[i][j] == 'd')ex = i, ey = j;}

	P.push((node) {sx, sy, 0});

	vis[sx][sy] = 1;

	bfs(P.front());

	if(mark == false) printf("No Way!\n");

}