#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");

int n,m,a[105][105],i,j,ii,jj,pr,ul,nr,xr,yr,xj,yj,k,romeo[105][105],julieta[105][105],minn=2000000000,x,y;
int dl[]={-1,0,1,0};
int dc[]={0,1,0,-1};
char s[105];
struct op
{
    int lin,col;
}coada[10005];

struct element
{
    int x,y,val;
}v[10005];

int main()
{
    fin>>n>>m;
    ii=1;
    jj=1;
    fin.get();
    for(j=1;j<=n;j++)
    {
        fin.getline(s,105);
        for(i=0;i<strlen(s);i++)
        {
            if(s[i]==' ')
            {
                a[j][jj]=0;
                romeo[j][jj]=0;
                julieta[j][jj]=0;
            }
            if(s[i]=='X')
            {
                a[j][jj]=-1;
                romeo[j][jj]=-1;
                julieta[j][jj]=-1;
            }
            if(s[i]=='R')
            {
                a[j][jj]=0;
                xr=j;
                yr=jj;
            }
            if(s[i]=='J')
            {
                a[j][jj]=0;
                xj=j;
                yj=jj;
            }
            jj++;
        }
        ii++;
        jj=1;
    }
    pr=1;
    ul=1;
    nr=1;
    ii=0;
    jj=0;
    coada[1]={xr,yr};
    while(nr>0)
    {
        i=coada[pr].lin;
        j=coada[pr].col;
        for(k=0;k<4;k++)
        {
            ii=i+dl[k];
            jj=j+dc[k];
            if(ii>=1 && ii<=n && jj>=1 && jj<=m && romeo[ii][jj]==0)
            {
                romeo[ii][jj]=romeo[i][j]+1;
                ul++;
                nr++;
                coada[ul]={ii,jj};
            }
        }
        pr++;
        nr--;
    }
    romeo[xr][yr]=0;
    pr=1;
    ul=1;
    nr=1;
    ii=0;
    jj=0;
    coada[1]={xj,yj};
    while(nr>0)
    {
        i=coada[pr].lin;
        j=coada[pr].col;
        for(k=0;k<4;k++)
        {
            ii=i+dl[k];
            jj=j+dc[k];
            if(ii>=1 && ii<=n && jj>=1 && jj<=m && julieta[ii][jj]==0)
            {
                julieta[ii][jj]=julieta[i][j]+1;
                ul++;
                nr++;
                coada[ul]={ii,jj};
            }
        }
        pr++;
        nr--;
    }
    julieta[xj][yj]=0;
    nr=0;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(romeo[i][j]==julieta[i][j] && romeo[i][j]!=0 && julieta[i][j]!=0 && romeo[i][j]!=-1 && julieta[i][j]!=-1)
            {
                nr++;
                v[nr].val=romeo[i][j];
                v[nr].x=i;
                v[nr].y=j;
            }
        }
    }
    for(i=1;i<=nr;i++)
    {
        if(v[i].val<minn)
        {
            minn=v[i].val;
            x=v[i].x;
            y=v[i].y;
        }
    }
    fout<<minn<<" "<<x<<" "<<y;
    return 0;
}