1 #include<algorithm>
 2 #include<iostream>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<vector>
 7 #include<queue>
 8 #include<map>
 9 using std::min;
10 using std::cin;
11 using std::cout;
12 using std::endl;
13 using std::find;
14 using std::sort;
15 using std::map;
16 using std::pair;
17 using std::queue;
18 using std::vector;
19 using std::multimap;
20 #define pb(e) push_back(e)
21 #define sz(c) (int)(c).size()
22 #define mp(a, b) make_pair(a, b)
23 #define all(c) (c).begin(), (c).end()
24 #define iter(c) decltype((c).begin())
25 #define cls(arr,val) memset(arr,val,sizeof(arr))
26 #define cpresent(c, e) (find(all(c), (e)) != (c).end())
27 #define rep(i, n) for (int i = 0; i < (int)(n); i++)
28 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
29 const int N = 210;
30 const int INF = ~0u >> 1;
31 typedef unsigned long long ull;
32 char G[N][N];
33 int H, W, Sx, Sy, Dx, Dy, dist[2][N][N];
34 const int dx[] = { 0, 0, -1, 1 }, dy[] = { -1, 1, 0, 0 };
35 struct Node {
36     int x, y;
37     Node(int i = 0, int j = 0) :x(i), y(j) {}
38 }Y, M;
39 void bfs(int x, int y, bool d) {
40     queue<Node> q;
41     q.push(Node(x, y));
42     dist[d][x][y] = 0;
43     while (!q.empty()) {
44         Node t = q.front(); q.pop();
45         rep(i, 4) {
46             int nx = t.x + dx[i], ny = t.y + dy[i];
47             if (nx < 0 || nx >= H || ny < 0 || ny >= W) continue;
48             if (G[nx][ny] == ‘#‘ || dist[d][nx][ny]) continue;
49             dist[d][nx][ny] = dist[d][t.x][t.y] + 1;
50             q.push(Node(nx, ny));
51         }
52     }
53 }
54 int main() {
55 #ifdef LOCAL
56     freopen("in.txt", "r", stdin);
57     freopen("out.txt", "w+", stdout);
58 #endif
59     while (~scanf("%d %d", &H, &W)) {
60         cls(dist, 0);
61         vector<Node> kfc;
62         rep(i, H) {
63             scanf("%s", G[i]);
64             rep(j, W) {
65                 if (G[i][j] == ‘Y‘) Sx = i, Sy = j;
66                 if (G[i][j] == ‘M‘) Dx = i, Dy = j;
67                 if (G[i][j] == ‘@‘) kfc.pb(Node(i, j));
68             }
69         }
70         bfs(Sx, Sy, 0), bfs(Dx, Dy, 1);
71         int res = INF;
72         rep(i, sz(kfc)) {
73             Node &k = kfc[i];
74             int A = dist[0][k.x][k.y], B = dist[1][k.x][k.y];
75             if (!A || !B) continue;
76             res = min(res, A + B);
77         }
78         printf("%d\n", res * 11);
79     }
80     return 0;
81 }