#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 )
{
    mat[xi][yi] = 1;
    int l=1, i=0;
    a[l] = xi, b[l]= yi;
    while(i<=l && mat[N][N] == 0)
    {
       for(j=0; j<8; j++)
        {
            int ii = xi+dx[j];
            int jj = yi+dy[j];
            if( ii >=1 && ii<=n &&jj>=0 && jj<=m)
            {
               if(mat[ii][jj]==0)
               {
                   mat[ii][jj] = mat[a[l]][b[l]]+1;
                   l++;
                   a[l]=ii, b[l]=jj;
               }
               else continue;
            }
        }
        i++;
    }
}

void read_solve()
{
     f >> n >> m;
     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;
}