#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;

ifstream f("rj.in");
ofstream g("rj.out");

 int n, m;
 int a[102][102], b[102][102];
 int r1,r2,j1,j2,coloana;
char x[102];
void lee( int x,  int y,  int t[102][102], int val);

int main()
{
	f>>n>>m;
	f.get();
	for(int i=1;i<=n;i++){
		f.getline(x,102);
		for(unsigned k=0;k<strlen(x);k++)
			if(x[k]=='X'){
			a[i][k+1]=-1;
			b[i][k+1]=-1;}
		else
		if(x[k]=='R')
		{r1=i;
		r2=k+1;}
		else
			if(x[k]=='J')
			{j1=i;
			j2=k+1;}
		}
	
		
	a[r1][r2]=b[j1][j2]=1;	
	lee(r1,r2,a,1);
	lee(j1,j2,b,1);
	

	int pozx=n, pozy=m;
	int minim=32767;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(a[i][j]!=-1)
				if(a[i][j]==b[i][j] && a[i][j]!=0 && minim>a[i][j])
				{
				pozx=i;
				pozy=j;
				minim=a[i][j];
				}
			

 g<<minim<<" "<<pozx<<" "<<pozy;
return 0;
}

int eok(int x, int y)
{
	if(x>0 && x<=n && y>0 && y<=m)
		return 1;
	return 0;
}

 int di[]={0, 1, 0, -1, -1, 1, -1, 1};
 int dj[]={1, 0, -1, 0, -1, 1,  1,-1};

void lee(int x, int y, int t[102][102], int val)
{
	for(int i=0;i<8;i++)
		if(eok(x+di[i],y+dj[i]))
			if(t[x+di[i]][y+dj[i]]==0 || t[x+di[i]][y+dj[i]]>val+1)
			{
			t[x+di[i]][y+dj[i]]=val+1;
			lee(x+di[i],y+dj[i],t,val+1);
			}
}