#include 
//#include 
#include 
#include 
#include 
#define ll long long

using namespace std;
int n,m;
int main()
{
int n,m;
cin >> n >> m;
char mat[n][m];
int di[]={-1,1,0,0};
int dj[]={0,0,1,-1};
int si,sj,ei,ej;
int k;cin>>k;
for(int i=0;i> mat[i][j];
        if(mat[i][j] == 'M'){
            si =i;
            sj = j;
        }
        if(mat[i][j] == 'V'){
            ei =i;
            ej = j;
        }
    }
}
queueq;
vector> visited(n+1,vector(m+1,false));
q.push(si);
q.push(sj);
visited[si][sj]=true;
vector> cell;
int dist[n][m];
while(!q.empty()){
    int ci = q.front();
    q.pop();
    int cj = q.front();
    q.pop();
    visited[ci][cj] = true;
    if(mat[ci][cj] == 'V'){
        cout << "DA"<=0 and ti=0 and tj=0 and ti=0 and tj=0 and ti=0 and tj