#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main ()
{
    int n,m;
    cin >> n >> m;
    char a[100][100];
    int vjeko [2],plus[100][100];
    int jaza [2];
    int zbroj[100],x=0,y=0;
    for (int i=0; i<n; i++)
        for (int j=0; j<m; j++)
            cin >> a[i][j];
    for (int i=0; i<n; i++)
        for (int j=0; j<m; j++)
        {
            if (a[i][j]=='v') 
            {
               vjeko[0]=i;
               vjeko[1]=j;
            }  
            if (a[i][j]=='J') 
            {
               jaza[0]=i;
               jaza[1]=j;
            }
            if (a[i][j]=='+');
            {
               plus[x][y]=i;
               x++,y++;
               plus[x][y]=j;
               x++,y++;
            }
        }
    for (int i=vjeko[0]; i<jaza[0]; i++)
        for (int j=vjeko[1]; j<jaza[1]; j++)
        {
            if (a[i][j]=='.') 
               for (int k=0; k<x-1; k++)
                   for (int l=0; l<y-1; l++)
                   {
                       zbroj[k]=(i-k)+ (j-l);
                   }
        }
    sort (zbroj,zbroj+(x-1));
    cout << zbroj[x-1];
    //system ("pause");
    return 0;
}