#include <fstream>
#include<string.h>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int n,m,a[102][102],b[102][102],xi1,yi1,xi2,yi2,mini,imin,jmin;
char x[102];

int di[]={-1,-1,0,1,1,1,0,-1};
int dj[]={0,1,1,1,0,-1,-1,-1};

struct coada1{int i;int j;}c1[10003];
struct coada2{int i;int j;}c2[10003];

void LeeR()
{
    int i,j,p,u,k,inou,jnou;
    p=1;u=1;
    c1[1].i=xi1; c1[1].j=yi1;
    while(p<=u)
    {
        i=c1[p].i; j=c1[p].j;
        for(k=0;k<8;k++)
        {
            inou=i+di[k]; jnou=j+dj[k];
            if(a[inou][jnou]==0)
            {
                u++;
                c1[u].i=inou; c1[u].j=jnou;
                a[inou][jnou]=a[i][j]+1;
            }
        }
        p++;
    }
}

void LeeJ()
{
    int i,j,p,u,k,inou,jnou;
    p=1;u=1;
    c2[1].i=xi2; c2[1].j=yi2;
    while(p<=u)
    {
        i=c2[p].i; j=c2[p].j;
        for(k=0;k<8;k++)
        {
            inou=i+di[k]; jnou=j+dj[k];
            if(b[inou][jnou]==0)
            {
                u++;
                c2[u].i=inou; c2[u].j=jnou;
                b[inou][jnou]=b[i][j]+1;
            }
        }
        p++;
    }
}

int main()
{
    f>>n>>m;
    int i,j;
    f.get();
    //citire
    for(i=0;i<n;i++)
    {
        f.getline(x,101, '\n');
        for(j=0;j<m;j++)
        {
            if(x[j]=='R') { a[i+1][j+1]=1; xi1= i+1; yi1=j+1; b[i+1][j+1]=0;}
            if(x[j]=='J') { b[i+1][j+1]=1; xi2=i+1;yi2=j+1; a[i+1][j+1]=0;}
            if(x[j]=='X') {a[i+1][j+1]=-1;b[i+1][j+1]=-1;}
        }
    }
    //bordare
    for(i=0;i<=n+1;i++) a[i][0]=b[i][0]=a[i][m+1]=b[i][m+1]=-1;
    for(j=0;j<=m+1;j++) a[0][j]=b[0][j]=a[n+1][j]=b[n+1][j]=-1;
    LeeR();
     LeeJ();
     mini=100002;
     for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            if(a[i][j]==b[i][j] && a[i][j]<mini && a[i][j]>0)
            {
                mini=a[i][j];
                imin=i; jmin=j;
            }
    g<<mini<<' '<<imin<<' '<<jmin<<'\n';
}