#include<fstream>
#include<cstring>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int n,m,r[102][102],ju[102][102],r1,r2,j1,j2;
char c[102];
int ox[]={-1,-1,0,1,1,1,0,-1};
int oy[]={0,1,1,1,0,-1,-1,-1};
struct lee
{
    int l,c;
};
lee v[17000];
int main()
{
    f>>n>>m;
    f.get();
    for(int i=1;i<=n;++i)
    {
        f.get(c,102);
        f.get();
        for(int j=0;j<strlen(c);++j){
            if(c[j]=='X'){
                r[i][j+1]=-1;
                ju[i][j+1]=-1;
            }
            if(c[j]=='R'){
                r[i][j+1]=1;
                r1=i;
                r2=j+1;
            }
            if(c[j]=='J'){
                ju[i][j+1]=1;
                j1=i;
                j2=j+1;
            }
        }
    }
    for(int i=0;i<=m+1;++i)
        r[0][i]=r[n+1][i]=ju[0][i]=ju[n+1][i]=-1;
    for(int i=0;i<=n+1;++i)
        r[i][0]=r[i][m+1]=ju[i][0]=ju[i][m+1]=-1;
    int prim=1,ultim=1;
    v[prim].l=r1;
    v[prim].c=r2;
    while(prim<=ultim)
    {
        for(int 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(int 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=1000023l;
    int ll=0;
    int cc=0;
    for(int i=1;i<=n;++i)
        for(int 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;
}