#include <fstream>
#include <sstream>
#define nMax 100
#define mMax 100
#define DEBUG 0
#define DB if(DEBUG)
#define toupper1(c)   ((c>='a' && c<'z')?c-'a'+'A':c)
using namespace std;

using namespace std;

typedef pair<int, int> Pair;

int N,M,dcrt=0,vmax=nMax*mMax+1;
int X=vmax+'X',R=vmax+'R',J=vmax+'J',  Spatiu=vmax+' ';
int oras[nMax+1][mMax+1] {Spatiu};
int iR, jR, iJ, jJ, iIntalnire=X, jIntalnire=X, tminDrum;
int di[]={1,0,-1,-1,-1,0,1,1};
int dj[]={-1,-1,-1,0,1,1,1,0};

void citiremat(char numefis[])
{
    int i,j,k=0, jcmin, lngLinie;
    char cc;
    string  linie;
    ifstream in(numefis);

    getline(in,linie);
    stringstream ssin(linie);
    ssin>>N>>M;
    DB printf("N=%d M=%d\n",N,M);

    for(i=1;i<=N;i++){
        for(j=1;j<=M;j++)
            oras[i][j]=Spatiu;

    getline(in,linie);
    lngLinie = linie.length();
    jcmin = M<=lngLinie ? M:lngLinie;
    for(j=1;j<=jcmin;j++)
    {
        cc=linie[j-1];
        if(cc==0 || cc=='\r' || cc=='\n') break;
        if(cc==EOF) goto Final;

        DB k++;
        DB printf("%c",cc==' '?'.':cc);

        cc=toupper1(cc);
        if(cc=='X'||cc=='R'||cc=='J'||cc==' ')
                oras[i][j]=vmax+cc;
        if(cc=='R') {
                iR=i;
                jR=j;
        }
        else if(cc=='J') {
                iJ=i;
                jJ=j;
            }
        }
        DB printf("  --jcmin=%d\n", jcmin);
        linie="";
    }
     Final: DB printf(" iR=%d jR=%d iJ=%d jJ=%d k=%d ********\n", iR, jR, iJ, jJ, k);
}
void afismat(char * numefis)
{
    ofstream out(numefis);
    int i,j;
    DB printf("\n");
    for(i=1;i<=N;i++)
    {
        out<<endl;
        DB printf("\n");
        for(j=1;j<=M;j++) {
           out<<oras[i][j]<<" ";
           DB {
               if(oras[i][j]>vmax)
                    printf(" %c ",oras[i][j]-vmax);
               else printf("%2d ",oras[i][j]);
           }
        }
    }
}

void drecurs(int i, int j, int d){
    int dcrt=d;
    int k, iv, jv, oc ;
    for(k=0;k<8;k++){
        iv=i+di[k];
        if(iv<1||iv>N) continue;
        jv=j+dj[k];
        if(jv<1||jv>M) continue;
        oc=oras[iv][jv];
        if(oc==X || oc==R || oc==J) continue;
        if(oc > dcrt) {
                oras[iv][jv]= dcrt;
                drecurs(iv,jv, dcrt+1);
        }
    }
}

int timpminim(int i, int j){
    int k, iv, jv, oc,tmin=X ;
    for(k=0;k<8;k++){
        iv=i+di[k];
        if(iv<1||iv>N) continue;
        jv=j+dj[k];
        if(jv<1||jv>M) continue;
        oc=oras[iv][jv];
        if(oc==X || oc==R || oc==J) continue;
        if(oc%2==0) continue;
        if(oc < tmin) {
                tmin=oc;
        }
    }
    return tmin;
}

void cautaPunctDeIntalnire(int i, int j, int tstart,int tstop){
    int k, iv, jv, oc;
    DB printf("\ni=%d j=%d tstart=%d tstop=%d", i,j,tstart, tstop);
    for(k=0;k<8;k++){
        iv=i+di[k];
        if(iv<1||iv>N) continue;
        jv=j+dj[k];
        if(jv<1||jv>M) continue;
        oc=oras[iv][jv];
        if(oc<0) continue;
        if(oc==X || oc==R || oc==J) continue;
        if(oc == tstop) {
            if(iv<iIntalnire) {
                iIntalnire=iv;
                jIntalnire=jv;
            }
            if (iv==iIntalnire && jv<jIntalnire) {
                        jIntalnire=jv;
            }
            continue;
        }
        if(oc==tstart) {
            oras[iv][jv] = -oras[iv][jv];
            cautaPunctDeIntalnire(iv,jv, tstart-1,tstop);
        }
    }
}
int find_shortest_path();
int main()
{   int tmin;
    citiremat("rj.in");
    DB afismat("rjinit1.out");

    //drecurs(iR, jR, 1);
    tminDrum=find_shortest_path();
    DB printf("T_shortest_path=%d", tminDrum);
    DB afismat("rj1.out");
    tminDrum = timpminim(iJ,jJ);
    tmin=(tminDrum+1)/2;
    DB printf("\ntmin=%d",tminDrum);

    cautaPunctDeIntalnire(iJ,jJ,tminDrum,tmin);
    DB printf(" Intalnire=(%d, %d)",iIntalnire,jIntalnire);

    ofstream out("rj.out");
    out<< tmin << " " <<iIntalnire<<" " <<jIntalnire;
    DB printf("\n%d %d %d",tmin,iIntalnire,jIntalnire);
    return 0;
}
int queue_i[100];
int queue_j[100];
int liber=0;

void remq(){
if(liber==0) return;
DB printf("\nrem(%d,%d)\n",queue_i[liber-1],queue_j[liber-1]);
for(int i=0;i<liber-1;i++){
    queue_i[i]=queue_i[i+1];
    queue_j[i]=queue_j[i+1];
}
liber--;
}
void addq(int i, int j){
  queue_i[liber]=i;
  queue_j[liber]=j;
  liber++;
DB printf("add(%d,%d)- liber=%d    ",i,j,liber);

}
int find_shortest_path()
{
    int pfirst,psecond;
    int k, iv, jv, oc ;
  // stores distance from the begining, negative for unvisited
  // use BFS.  the queue stores unvisited positions.

  // start  from the begining point
  //q.push(beg);
    addq(iR,jR);
    oras[iR][jR]=0;
  while (liber>0) { // coada nu este vida
    // p is current position
    pfirst= queue_i[0]; // front()
    psecond= queue_j[0];
    remq();

    // if this is the ending position, finish.
    if (pfirst == iJ && psecond == jJ)
      break;

    // find adjacent unvisited positions
    for(k=0;k<8;k++){
        iv=pfirst+di[k];
        if(iv<1||iv>N) continue;
        jv=psecond+dj[k];
        if(jv<1||jv>M) continue;
        oc=oras[iv][jv];
        if(oc==X || oc==R ) continue;
        if(oc >= vmax) { //nevizitat
            addq(iv, jv);
          // update the distance at the unvisited position
            oras[iv][jv]= oras[pfirst][psecond] + 1;;
        }
    }
  }
   return oras[iJ][jJ];
}