#include <cstdio>
using namespace std;
int valid[102][102],a[102][102],ri,rj,ji,jj,i,j,kmin=32500,k,val,vi=200,vj=200,n,m;
char c;
void parcurgere()
{
	if((k<=kmin)&&(valid[i][j]==0)&&((a[i][j]>kmin)||(a[i][j]==0))){
		if((ji==i)&&(jj==j)&&(k%2==0)){
			kmin=k;val=1;}
		a[i][j]=k++;
		i--;parcurgere();i++;
		i++;parcurgere();i--;
		j--;parcurgere();j++;
		j++;parcurgere();j--;
		//###
		i--;j--;parcurgere();i++;j++;
		i++;j--;parcurgere();i--;j++;
		i--;j++;parcurgere();i++;j--;
		i++;j++;parcurgere();i--;j--;
		k--;
		if((k==kmin/2)&&(val)){val=0;if((vi>=i)&&(vj>=j)){vi=i;vj=j;}}
								   }
}
int main()
{
	freopen("rj.in","r",stdin);
	freopen("rj.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			scanf("%c",&c);
			if(c=='X'){valid[i][j]=1;}
			if(c=='R'){ri=i;rj=j;}
			if(c=='J'){ji=i;jj=j;}
						 }
		
					 }
	for(i=0;i<=n+1;i++){valid[i][0]=1;valid[i][m+1]=1;}
	for(j=0;j<=m+1;j++){valid[0][j]=1;valid[n+1][j]=1;}
	i=ri;j=rj;k=0;parcurgere();
	printf("%d %d %d\n",kmin/2,vi,vj);
return 0;
}