#include <iostream>
#include <cstdio>
#include <queue>
#include <fstream>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
const int N=105;
int n,m,dr[N][N],djul[N][N];
struct punct
{
    short int lin,col;
};
queue <punct> q;
const short int dlin[]={-1,-1,-1,0,1,1,1,0};
const short int dcol[]={-1,0,1,1,1,0,-1,-1};
int maxim(int d[N][N])
{
    int max=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(d[i][j]>max)
                max=d[i][j];
    return max;
}
void lee(int d[N][N],punct x0)
{
    punct x,y;
    q.push(x0);
    //d[x0.lin][x0.col]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0;i<8;i++)
        {
            y.lin=x.lin+dlin[i];
            y.col=x.col+dcol[i];
            if(d[y.lin][y.col]==0)
            {
                d[y.lin][y.col]=1+d[x.lin][x.col];
                q.push(y);
            }
        }
    }
}

void bordare(int d[N][N])
{
    for(int i=0;i<=n+1;i++)
		d[i][0]=d[i][m+1]=-1;
	for(int j=0;j<=m+1;j++)
		d[0][j]=d[n+1][j]=-1;
}

int main()
{
//    freopen("rj.in","r",stdin);
  //  freopen("rj.out","w",stdout);
    punct r,jul;
    char x[N];
    int i,j,min,mini,minj;
    in>>n>>m;//fscanf(stdin,"%d",&n);
    //fscanf(stdin,"%d",&m);
    in.getline(x,N);//fgets(x,N,stdin);
    for(i=1;i<=n;i++)
    {
        in.getline(x,N);//fgets(x,N,stdin);
        for(j=0;j<m;j++)
        {
           // in>>x;
            if(x[j]==' ')
                dr[i][j+1]=djul[i][j+1]=0;
            if(x[j]=='X')
                dr[i][j+1]=djul[i][j+1]=-1;
            if(x[j]=='R')
            {
                dr[i][j+1]=1;
                r.lin=i;
                r.col=j+1;
            }
            if(x[j]=='J')
            {
                djul[i][j+1]=1;
                jul.lin=i;
                jul.col=j+1;
            }
        }
    }
    bordare(dr);
    bordare(djul);
    lee(dr,r);
    lee(djul,jul);
    min=m*n;
    for( i=1 ; i<=n ; i++)
    {
        for( j=1 ; j<=m ; j++)
            if(dr[i][j]==djul[i][j] && dr[i][j]<min && dr[i][j]>0)
            {
                mini=i;
                minj=j;
                min=dr[i][j];

            }
    }
    out<<min<<' '<<mini<<' '<<minj<<' ';

    return 0;
}