#include<iostream>
#include<fstream>
#define DN 2000
#include<string.h>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
const int x[]={0,1,0,-1,-1,1,-1,1}; 
const int y[]={1,0,-1,0,-1,1,1,-1}; 
struct coord
{
	int x1, x2;
} c[105*105], c2;
int a[105][105], b[105][105], n, m, x3, x4, y3, y4;
char sir[105][105];

void lee(int v[105][105], int cord1, int cord2)
{
	int p=0, u=0, i, j;
	for(i=0;i<=n+1;i++)
		for(j=0;j<=m+1;j++)
			v[i][j]=-1;
	c[0].x1=cord1;  
	c[0].x2=cord2;   
	v[cord1][cord2]=1; 
	while(p<=u)    
	{       
		c2=c[p];      
		for(i=0;i<8;i++)        
		{            
			if(sir[c2.x1+x[i]][c2.x2+y[i]]==' ' && v[c2.x1+x[i]][c2.x2+y[i]]==-1)           
			{
				v[c2.x1+x[i]][c2.x2+y[i]]=v[c2.x1][c2.x2]+1;
				u++;				
				c[u].x1=c2.x1+x[i];
				c[u].x2=c2.x2+y[i];
			}
		}
		p++;
	}           
}

int main()
{
	int i,j, timpm=102*102+5, xmin=-1, ymin=-1; 
	char s;
	fin>>n>>m;
	for(i=0;i<=n+1;i++)
		sir[i][0]=sir[i][m+1]='X';
	for(i=0;i<=m+1;i++)
		sir[0][i]=sir[n+1][i]='X';
	
	fin.get(s);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			fin.get(s);
			sir[i][j]=s;
			if(sir[i][j]=='R')
			{
				x3=i;y3=j;sir[i][j]=' ';
			}
			if(sir[i][j]=='J')
			{
				x4=i;y4=j;sir[i][j]=' ';
			}
		}
		fin.get(s);
	}
	
	lee(a, x3, y3); lee(b, x4, y4);

	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			if(a[i][j]==b[i][j])
				if(a[i][j]<timpm && a[i][j]!=-1)
				{
					timpm=a[i][j]; xmin=i; ymin=j;
				}
	fout<<timpm<<" "<<xmin<<" "<<ymin<<"\n";
	
}