#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
string s;
queue <int> qx,qy;
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,1,0,-1,1,-1,1,-1};
int n,m,jx,jy,rx,ry,i,j,x,y,xx,yy,a[105][105],r[105][105],jl[105][105];
int main()
{
    fin>>n>>m;
    for(i=0;i<=n;i++)
    {
        getline(fin,s);
        for(j=0;j<m;j++)
        {
            if(s[j]=='X')
            {
                r[i][j+1]=-1;
                jl[i][j+1]=-1;
            }
            if(s[j]=='R')
            {
                r[i][j+1]=1;
                rx=i;
                ry=j+1;
            }
            if(s[j]=='J')
            {
                jl[i][j+1]=1;
                jx=i;
                jy=j+1;
            }
        }
    }
    qx.push(rx);
    qy.push(ry);
    r[rx][ry]=1;
    while(!qx.empty())
    {
        x=qx.front();
        y=qy.front();
        qx.pop();
        qy.pop();
        for(i=0;i<8;i++)
        {
            xx=x+dx[i];
            yy=y+dy[i];
            if(xx>=1 && yy>=1 && xx<=n && yy<=m && r[xx][yy]==0)
            {
                r[xx][yy]=r[x][y]+1;
                qx.push(xx);
                qy.push(yy);
            }
        }
    }
    qx.push(jx);
    qy.push(jy);
    jl[jx][jy]=1;
    while(!qx.empty())
    {
        x=qx.front();
        y=qy.front();
        qx.pop();
        qy.pop();
        for(i=0;i<8;i++)
        {
            xx=x+dx[i];
            yy=y+dy[i];
            if(xx>=1 && yy>=1 && xx<=n && yy<=m && jl[xx][yy]==0)
            {
                jl[xx][yy]=jl[x][y]+1;
                qx.push(xx);
                qy.push(yy);
            }
        }
    }
    int minn=10000,a,b;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(r[i][j]==jl[i][j] && r[i][j]<minn && r[i][j]>0)
            {
                minn=r[i][j];
                a=i;
                b=j;
            }
        }
    }
    fout<<minn<<" "<<a<<" "<<b;
    return 0;
}