#include <iostream>

#include <cstdio>

#include <vector>

#include <queue>

#include <cmath>

#include <string>

#include <string.h>

#include <algorithm>

using namespace std;

#define LL __int64

#define eps 1e-8

#define INF 1e8

#define lson l , m , rt << 1

#define rson m + 1 , r , rt << 1 | 1

const int MOD = ;

const int maxn =  + ;

struct Pos {

    int x , y;

};

Pos dir[] = {{- , } , { , } , { , } , { , -}};

vector <Pos> kfc;

int dist1[maxn][maxn] , dist2[maxn][maxn];

int vis[maxn][maxn] , dist[maxn][maxn];

char map[maxn][maxn];

int n , m;

bool place(Pos a)

{

    if(a.x <  || a.y <  || a.x >= n || a.y >= m || map[a.x][a.y] == '#' || vis[a.x][a.y])

        return false;

    return true;

}

void BFS(Pos start , int a[][maxn])

{

    memset(vis ,  , sizeof(vis));

    queue <Pos> que;

    que.push(start);

    vis[start.x][start.y] = ;

    dist[start.x][start.y] = ;

    while(!que.empty()) {

        Pos u = que.front();

        que.pop();

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

            Pos tmp;

            tmp.x = u.x + dir[i].x;

            tmp.y = u.y + dir[i].y;

            if(!place(tmp))

                continue;

            else {

                que.push(tmp);

                vis[tmp.x][tmp.y] = ;

                dist[tmp.x][tmp.y] = dist[u.x][u.y] + ;

                if(map[tmp.x][tmp.y] == '@')

                    a[tmp.x][tmp.y] = dist[tmp.x][tmp.y];

            }

        }

    }

}

int main()

{

    int i , j;

    Pos start , end;

    char ch;

    while(~scanf("%d %d" , &n , &m))

    {

        memset(dist1 ,  , sizeof(dist1));

        memset(dist2 ,  , sizeof(dist2));

        kfc.clear();

        for(i =  ; i < n ; i++)

            scanf("%s" , map[i]);

        for(i =  ; i < n ; i++) {

            for(j =  ; j < m ; j++) {

                if(map[i][j] == 'Y') {

                    start.x = i;

                    start.y = j;

                } else if(map[i][j] == 'M') {

                    end.x = i;

                    end.y = j;

                } else if(map[i][j] == '@') {

                    Pos tmp = {i , j};

                    kfc.push_back(tmp);

                }

            }

        }

        BFS(start , dist1);

        BFS(end , dist2);

        int Min = INF;

        for(i =  ; i < kfc.size() ; i++) {

            int x = kfc[i].x;

            int y = kfc[i].y;

            if(Min > dist1[x][y] + dist2[x][y] && dist1[x][y] && dist2[x][y])

                Min = dist1[x][y] + dist2[x][y];

        }

        printf("%d\n" ,  * Min);

    }

    return ;

}