#include <fstream>
#include <queue>
#define N 102
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");

int dx[]={-1,-1,0,1,1,1,0,-1};
int dy[]={0,1,1,1,0,-1,-1,-1};
char sterg[N];
int mr[N][N], mj[N][N], i, j, n, k, xinc, yinc, xsf, ysf, c, l, a[N], b[N], m, mini=N*N;

void Lee(int mat[N][N],int xi,int yi){
    int ii,jj;
    queue <pair <int, int > > Q;
    mat[xi][yi]=1;
    Q.push(make_pair(xi,yi));
    while(!Q.empty())
    {
        for(int k=0;k<8;k++)
        {
            ii=Q.front().first+dx[k];
            jj=Q.front().second+dy[k];
            if(!(ii>=1&&ii<=n&&jj>=1&&jj<=m))
            continue;
            if(mat[ii][jj]==0)
            {
                mat[ii][jj]=mat[Q.front().first][Q.front().second]+1;
               Q.push(make_pair(ii,jj));
            }
        }
        Q.pop();
    }
}

void read_solve()
{
     f >> n >> m;
     f.get();
     for(i=1; i<=n; i++)
     {
         f.getline(sterg, N);
         for(j=0; j<m; j++)
            {
                if ( sterg[j] == 'X' )
                    mr[i][j+1]=mj[i][j+1]=-1;
                else
                 if(sterg[j] == 'R')
                 {
                    xinc = i;
                    yinc = j+1;
                }
                else
                 if(sterg[j]=='J')
                 {
                    xsf = i;
                    ysf = j+1;
                }
            }

    }
    Lee( mr, xinc, yinc);
    Lee( mj, xsf, ysf);
    for(i=1; i<=n; i++)
    for(j=1; j<=m; j++)
        if(mr[i][j] == mj[i][j] && mr[i][j]>0 && mr[i][j]<mini)
    {
        mini=mr[i][j];
        l=i;
        c=j;
    }

    g << mini << " "<< l <<" "<< c;
}
int main()
{
    read_solve();
    return 0;
}