#include <cstdio>
#include <queue>
using namespace std;
int R[101][101],J[101][101];
struct cord
{
   int x,y;
};
queue<cord>H1;
queue<cord>H2;
char v[111];
int col[8]={0,1,1,1,0,-1,-1,-1},lin[8]={-1,-1,0,1,1,1,0,-1};
int main()
{
    freopen("rj.in","r",stdin);
    freopen("rj.out","w",stdout);
    int n,m,q,i,tmin=999999,x,y,R1,R2,J1,J2;
    scanf("%d%d\n",&n,&m);
    for(q=1;q<=n;q++)
    {
        fgets(v,1000,stdin);
        for(i=0;v[i]!='\n';i++)
        {
            if(v[i]=='X') R[q][i+1]=J[q][i+1]=-1;
            else if(v[i]==' ') R[q][i+1]=J[q][i+1]=0;
            else if(v[i]=='R') R1=q,R2=i+1;
            else J1=q,J2=i+1;
        }
    }
    cord pas,ruc;
    pas.x=R1;pas.y=R2;
    R[R1][R2]=1;
    H1.push(pas);
    while(H1.size()!=0)
    {
        pas=H1.front();
        for(i=0;i<8;i++)
        {
            ruc.x=pas.x+lin[i];
            ruc.y=pas.y+col[i];
            if(ruc.x>=1&&ruc.x<=n&&ruc.y>=1&&ruc.y<=m)
            {
                if(R[ruc.x][ruc.y]==0)
                {
                    R[ruc.x][ruc.y]=R[pas.x][pas.y]+1;
                    H1.push(ruc);
                }
            }
        }
        H1.pop();
    }
    J[J1][J2]=1;
    pas.x=J1;pas.y=J2;
    H2.push(pas);
    while(H2.size()!=0)
    {
        pas=H2.front();
        for(i=0;i<8;i++)
        {
            ruc.x=pas.x+lin[i];
            ruc.y=pas.y+col[i];
            if(ruc.x>=1&&ruc.x<=n&&ruc.y>=1&&ruc.y<=m)
            {
                if(J[ruc.x][ruc.y]==0)
                {
                    J[ruc.x][ruc.y]=J[pas.x][pas.y]+1;
                    H2.push(ruc);
                }
            }
        }
        H2.pop();
    }
    int j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(R[i][j]>1&&J[i][j]>1)
            {
                 if(R[i][j]==J[i][j]&&R[i][j]<tmin) tmin=R[i][j],x=i,y=j;
            }
        }
    }
    printf("%d %d %d",tmin,x,y);
}