#include <stdio.h>
#define N 125
#define M 125
using namespace std;
const int dl[]= {-1,1,0,0,-1,-1,1,1};
const int dc[]= {0,0,-1,1,1,-1,1,-1};
struct poz
{
    int l,c;
};
poz q1[N*M],q2[N*M],x,y;
char a[N][M];
int d[N][M],k[N][M],p1=0,p2=0,u1=-1,u2=-1,tmin=200;
void romeo()
{int a;
    while(p1<=u1)
    {
        x=q1[p1++];
        for(a=0; a<8; a++)
        {
            y.l=x.l+dl[a];
            y.c=x.c+dc[a];
            if(d[y.l][y.c]==-5)
            {
                d[y.l][y.c]=d[x.l][x.c]+1;
                q1[++u1]=y;
            }
        }
    }
}
void julieta()
{int b;
    while(p2<=u2)
    {
        x=q2[p2++];
        for(b=0; b<8; b++)
        {
            y.l=x.l+dl[b];
            y.c=x.c+dc[b];
            if(k[y.l][y.c]==-5)
            {
                k[y.l][y.c]=k[x.l][x.c]+1;
                q2[++u2]=y;
            }
        }
    }
}
int main()
{
    int n,m,i,j,imin,jmin;
    freopen("rj.in","r",stdin);
    freopen("rj.out","w",stdout);
    scanf("%d%d\n",&n,&m);
    for(i=0; i<n+1; i++)
    {
        a[i][0]=a[i][n+1]=-5;
        d[i][0]=d[i][n+1]=-5;
    }
    for(j=0; j<=m; j++)
    {
        a[0][j]=a[m+1][j]=-5;
        d[0][j]=d[m+1][j]=-5;
    }
    for(i=1; i<=n; i++)
    {
        gets(1+a[i]);
        for(j=1; j<=m; j++)
        {
            if(a[i][j]=='R')
            {
                d[i][j]=0;
                q1[++u1]=(poz)
                {
                    i,j
                };
            }
            else if(a[i][j]=='J')
            {
                k[i][j]=0;
                q2[++u2]=(poz)
                {
                    i,j
                };
            }
            else if(a[i][j]=='X')
                d[i][j]=k[i][j]=-1;
            else
                d[i][j]=k[i][j]=-5;
        }
    }
    romeo();
    julieta();
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
            if(d[i][j]==k[i][j]&&d[i][j]<tmin&&d[i][j]>0)
            {
                tmin=d[i][j]+1;
                imin=i;
                jmin=j;
            }
    printf("%d %d %d",tmin,imin,jmin);
    return 0;
}