#include<stdio.h>
#include<string.h>
int i,j,n,m,a[101][101],r[101][101],ju[101][101],sol,min=999999999,ir,ij,jj,jr,iv,jv,in,sf,pozi,pozj;
int di[]={0,1,0,-1,0,1,-1,1,-1};
int dj[]={0,0,-1,0,1,1,-1,-1,1};
char c[110];
struct cod
{
    int i,j,cost;
};
cod q[100000],aux;
int main()
{
    freopen("rj.in","r",stdin);
    freopen("rj.out","w",stdout);
    scanf("%d%d\n",&n,&m);
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            r[i][j]=99999999;
            ju[i][j]=99999999;
        }
    for(i=0;i<=n+1;i++) a[i][0]=a[i][m+1]='X';
    for (i=0;i<=m+1;i++) a[0][i]=a[n+1][i]='X';
    for(i=1;i<=n;i++)
    {
        gets(c);
        for(j=0;j<m;j++)
        {
            if(c[j]=='R')
            {
                ir=i;
                jr=j+1;
                r[i][j+1]=1;
            }
            if(c[j]=='J')
            {
                ij=i;
                jj=j+1;
                ju[i][j+1]=1;
            }
            if(c[j]=='X')
                a[i][j+1]=1;
        }

    }
        in=1;sf=2;
        q[in].i=ir;
        q[in].j=jr;
        q[in].cost=1;
        while(in<sf)
        {
            aux=q[in];
            in++;
            for(i=1;i<=8;i++)
            {
                iv=aux.i+di[i];
                jv=aux.j+dj[i];
                if(a[iv][jv]!=1&&r[iv][jv]>r[aux.i][aux.j]+1&&iv>0&&iv<=n&&jv>0&&jv<=m)
                {
                    q[sf].i=iv;
                    q[sf].j=jv;
                    q[sf].cost=r[aux.i][aux.j]+1;
                    r[iv][jv]=r[aux.i][aux.j]+1;
                    sf++;
                }
            }
        }
       in=1;sf=2;
        q[in].i=ij;
        q[in].j=jj;
        q[in].cost=1;
        while(in<sf)
        {
            aux=q[in];
            in++;
            for(i=1;i<=8;i++)
            {
                iv=aux.i+di[i];
                jv=aux.j+dj[i];
                if(a[iv][jv]!=1&&ju[iv][jv]>ju[aux.i][aux.j]+1&&iv>0&&iv<=n&&jv>0&&jv<=m)
                {
                    q[sf].i=iv;
                    q[sf].j=jv;
                    q[sf].cost=ju[aux.i][aux.j]+1;
                    ju[iv][jv]=ju[aux.i][aux.j]+1;
                    sf++;
                }
            }
        }
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                if(r[i][j]==ju[i][j])
                    if(r[i][j]<min)
                        {
                            min=r[i][j];
                            pozi=i;
                            pozj=j;
                        }
        printf("%d %d %d",min,pozi,pozj);
        return 0;

}