#include<fstream>
#include<cstring>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int n,m,r[105][105],ju[105][105],r1,r2,j1,j2;
char c[112];
short ox[] = {-1,-1,-1, 0, 1, 1, 1, 0};
short oy[] = {-1, 0, 1, 1, 1, 0,-1,-1};
struct lee
{
    int l,c;
};
lee v[10000];
int main()
{
    f>>n>>m;
    f.get();
    int i,j;
    for(i=1;i<=n;++i)
    {
        f.getline(c,110);
        for(j=0;j<strlen(c);++j){
            if(c[j]==' ')
                continue;
            else
                if(c[j]=='X')
                    r[i][j+1]=-1;
                else
                    if(c[j]=='R'){
                        r1=i;
                        r2=j+1;
                    }
                    else
                    {
                        j1=i;
                        j2=j+1;
                    }
        }
    }
    for(i=0;i<=n+1;++i)
        r[0][i]=r[n+1][i]=-1;
    for(i=0;i<=m+1;++i)
        r[i][0]=r[i][m+1]=-1;
    for(i=0;i<=n+1;++i)
        for(j=0;j<=m+1;++j)
            ju[i][j]=r[i][j];
    r[r1][r2]=1;
    ju[j1][j2]=1;
    int prim=1,ultim=1;
    v[prim].l=r1;
    v[prim].c=r2;
    while(prim<=ultim)
    {
        for(i=0;i<=7;++i)
        {
            int x=v[prim].l+ox[i];
            int y=v[prim].c+oy[i];
            if(r[x][y]==0)
            {
                ++ultim;
                v[ultim].l=x;
                v[ultim].c=y;
                r[x][y]=r[v[prim].l][v[prim].c]+1;
            }
        }
        ++prim;
    }
    prim=1;
    ultim=1;
    v[prim].l=j1;
    v[prim].c=j2;
    while(prim<=ultim)
    {
        for(i=0;i<=7;++i)
        {
            int x=v[prim].l+ox[i];
            int y=v[prim].c+oy[i];
            if(ju[x][y]==0)
            {
                ++ultim;
                v[ultim].l=x;
                v[ultim].c=y;
                ju[x][y]=ju[v[prim].l][v[prim].c]+1;
            }
        }
        ++prim;
    }
    int tmin=100023l;
    int ll=0;
    int cc=0;
    for(i=1;i<=n;++i)
        for(j=1;j<=m;++j){
            if(r[i][j]==0)
                r[i][j]=-1;
            if(ju[i][j]==0)
                ju[i][j]=-1;
            if(r[i][j]==ju[i][j] && r[i][j]>0){
                tmin=min(tmin,r[i][j]);
                if(r[i][j]==tmin)
                {
                    ll=i;
                    cc=j;
                }
            }
        }
    g<<tmin<<" "<<ll<<" "<<cc<<'\n';
    return 0;
}