#include<fstream>
#include<string>
using namespace std;
const int dx[]={0,-1,-1,-1,0,1,1,1,0};
const int dy[]={0,-1,0,1,1,1,0,-1,-1};
int a[150][150],b[150][150];
int n,m,iJ,jJ,iR,jR,minn,im,jm;
int ci[10000],cj[10000],pp[10000];
void citire()
{
	char x;
	int i,j;
	ifstream in("rj.in");
	in>>n>>m;
	in.get();
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			in.get(x);
			if(x=='J')
			{
				iJ=i;
				jJ=j;
			}
			else if(x=='R')
			{
				iR=i;
				jR=j;
			}
			else if(x=='X')
				a[i][j]=b[i][j]=-1;
		}
		in.get();
	}
	for(i=0;i<=n+1;i++)
		a[i][0]=a[i][m+1]=b[i][0]=b[i][m+1]=-1;
	for(j=1;j<=m;j++)
		a[0][j]=a[n+1][j]=b[0][j]=b[n+1][j]=-1;
	in.close();
}
void lee1(int i,int j,int pas)
{
	int k,x,y;
	if(a[i][j]>=pas||a[i][j]==0)
	{
		a[i][j]=pas;
		for(k=1;k<=8;k++)
		{
			x=i+dx[k];
			y=j+dy[k];
			lee1(x,y,pas+1);
		}
	}
}
void drum(int i,int j)
{
	int x,y,k;
	if(a[i][j]==minn)
	{
		im=i;
		jm=j;
	}
	else if(a[i][j]>minn)
	{
		for(k=1;k<=8;k++)
		{
			x=i+dx[k];
			y=j+dy[k];
			if(a[x][y]+1==a[i][j])
				drum(x,y);
		}
	}
}
int main()
{
	ofstream out("rj.out");
	citire();
	lee1(iJ,jJ,1);
	minn=(a[iR][jR]/2)+1;
	drum(iR,jR);
	out<<minn<<" "<<im<<" "<<jm<<'\n';
	out.close();
	return 0;
}