#include<iostream>

 #include<cstdlib>

 #include<cstdio>

 #include<cstring>

 #include<queue>

 #define MAX 0x7f7f7f7f

 using namespace std;

 int n,m;

 int startY_x,startY_y;

 int startM_x,startM_y;

 char map[][];

 int d[][]={,,-,,,,,-};

 int vis1[][];

 int vis2[][];

 class node

 {

         public:

         int x;

         int y;

         int time;

 }cur,next;

 queue<node>q;

 bool Jude(int x,int y)

 {

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

               return false;

       return true;

 }

 void init()

 {

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

                 for(int j=;j<;j++)

                 {

                         vis1[i][j]=;

                         vis2[i][j]=;

                 }

 }

 void  bfs(int key)

 {

         while(!q.empty())

         {

                cur=q.front();

                q.pop();

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

                {

                        int x=cur.x+d[i][];

                        int y=cur.y+d[i][];

                        if(!Jude(x,y)) continue;

                        if(key==)

                                {

                                       if(vis1[x][y]) continue;

                                       next.x=x;

                                       next.y=y;

                                       next.time=cur.time+;

                                       vis1[x][y]=next.time;

                                       q.push(next);

                                }

                        if(key==)

                                 {

                                         if(vis2[x][y]) continue;

                                         next.x=x;

                                         next.y=y;

                                         next.time=cur.time+;

                                         vis2[x][y]=next.time;

                                         q.push(next);

                                 }

                 }

         }

 }

 int  main()

 {

         while(scanf("%d%d",&n,&m)!=EOF)

         {

                 init();

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

                 {

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

                        {

                                cin>>map[i][j];

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

                                {

                                        startY_x=i;

                                        startY_y=j;

                                }

                                if(map[i][j]=='M')

                                {

                                        startM_x=i;

                                        startM_y=j;

                                }

                        }

                 }

                 cur.x=startY_x;

                 cur.y=startY_y;

                 cur.time=;

                 vis1[cur.x][cur.y]=;

                 q.push(cur);

                 bfs();

                 while(!q.empty()) q.pop();

                 cur.x=startM_x;

                 cur.y=startM_y;

                 cur.time=;

                 vis2[cur.x][cur.y]=;

                 q.push(cur);

                 bfs();

                 long long ans=MAX;

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

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

                         {

                                if(map[i][j]=='@' && vis1[i][j] && vis2[i][j])

                                {

                                        long long  temp=vis1[i][j]+vis2[i][j];

                                        ans=min(ans,temp);

                                }

                         }

                  cout<<ans*<<endl;

 }

         return ;

 }