#include <cstdio>
#include <queue>
using namespace std;
int R[101][101],J[101][101];
struct cord
{
    char x,y;
};
queue<cord>H1;
queue<cord>H2;
char v[101];
int col[4]={0,1,0,-1},lin[4]={-1,0,1,0};
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,'\n',stdin);
        for(i=0;i<m;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;
    H1.push(pas);
    while(H1.size()!=0&&R[J1][J2]==0)
    {
        pas=H1.front();
        for(i=0;i<4;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();
    }

    pas.x=J1;pas.y=J2;
    H2.push(pas);
    while(H2.size()!=0&&J[R1][R2]==0)
    {
        pas=H2.front();
        for(i=0;i<4;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;
                    if(R[ruc.x][ruc.y]>0)
                        {
                            if(R[ruc.x][ruc.y]>=J[ruc.x][ruc.y]&&R[ruc.x][ruc.y]<tmin) tmin=R[ruc.x][ruc.y],x=ruc.x,y=ruc.y;
                            else if(J[ruc.x][ruc.y]>=R[ruc.x][ruc.y]&&J[ruc.x][ruc.y]<tmin) tmin=J[ruc.x][ruc.y],x=ruc.x,y=ruc.y;
                        }
                    H2.push(ruc);
                }
            }
        }
        H2.pop();
    }
    printf("%d %d %d",tmin,x,y);
}