#include<fstream>
#include<cstring>
using namespace std;
struct ceva {short x;short y;} c[10006];
short a[102][102],b[102][102],i,j,k,n,m,l1,c1,l2,c2,x,y;
char g[101];
int main()
{
	ifstream fcin("rj.in");
	ofstream fcout("rj.out");
	fcin>>n>>m;
	short min=30000;
	for(i=0;i<=m+1;i++)
		a[i][0]=a[i][n+1]=b[i][0]=b[i][n+1]=31000;
	for(i=0;i<=n+1;i++)
		a[0][i]=a[m+1][i]=b[0][i]=b[m+1][i]=31000;
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			a[i][j]=b[i][j]=30555;
	for(i=1;i<=n;i++)
	{
		fcin.get();
		fcin.get(g,m+1,'\n');
		for(j=0;j<m;j++)
			if(g[j]=='X')
				a[i][j+1]=b[i][j+1]=31000;
			else
				if(g[j]=='R')
					l1=i,c1=j+1,a[l1][c1]=0;
				else
					if(g[j]=='J')
						l2=i,c2=j+1,b[l2][c2]=0;
	}
	c[++k].x=l1;
	c[k].y=c1;
	for(i=1;i<=k;i++)
	{
		if(a[c[i].x-1][c[i].y-1]==30555)
		{
			a[c[i].x-1][c[i].y-1]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x-1;
			c[k].y=c[i].y-1;
		}
		if(a[c[i].x-1][c[i].y]==30555)
		{
			a[c[i].x-1][c[i].y]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x-1;
			c[k].y=c[i].y;
		}
		if(a[c[i].x-1][c[i].y+1]==30555)
		{
			a[c[i].x-1][c[i].y+1]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x-1;
			c[k].y=c[i].y+1;
		}
		if(a[c[i].x][c[i].y-1]==30555)
		{
			a[c[i].x][c[i].y-1]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x;
			c[k].y=c[i].y-1;
		}
		if(a[c[i].x][c[i].y+1]==30555)
		{
			a[c[i].x][c[i].y+1]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x;
			c[k].y=c[i].y+1;
		}
		if(a[c[i].x+1][c[i].y-1]==30555)
		{
			a[c[i].x+1][c[i].y-1]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x+1;
			c[k].y=c[i].y-1;
		}
		if(a[c[i].x+1][c[i].y]==30555)
		{
			a[c[i].x+1][c[i].y]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x+1;
			c[k].y=c[i].y;
		}
		if(a[c[i].x+1][c[i].y+1]==30555)
		{
			a[c[i].x+1][c[i].y+1]=a[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x+1;
			c[k].y=c[i].y+1;
		}
	}
	k=0;
	c[++k].x=l2;
	c[k].y=c2;
	for(i=1;i<=k;i++)
	{
		if(b[c[i].x-1][c[i].y-1]==30555)
		{
			b[c[i].x-1][c[i].y-1]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x-1;
			c[k].y=c[i].y-1;
		}
		if(b[c[i].x-1][c[i].y]==30555)
		{
			b[c[i].x-1][c[i].y]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x-1;
			c[k].y=c[i].y;
		}
		if(b[c[i].x-1][c[i].y+1]==30555)
		{
			b[c[i].x-1][c[i].y+1]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x-1;
			c[k].y=c[i].y+1;
		}
		if(b[c[i].x][c[i].y-1]==30555)
		{
			b[c[i].x][c[i].y-1]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x;
			c[k].y=c[i].y-1;
		}
		if(b[c[i].x][c[i].y+1]==30555)
		{
			b[c[i].x][c[i].y+1]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x;
			c[k].y=c[i].y+1;
		}
		if(b[c[i].x+1][c[i].y-1]==30555)
		{
			b[c[i].x+1][c[i].y-1]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x+1;
			c[k].y=c[i].y-1;
		}
		if(b[c[i].x+1][c[i].y]==30555)
		{
			b[c[i].x+1][c[i].y]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x+1;
			c[k].y=c[i].y;
		}
		if(b[c[i].x+1][c[i].y+1]==30555)
		{
			b[c[i].x+1][c[i].y+1]=b[c[i].x][c[i].y]+1;
			c[++k].x=c[i].x+1;
			c[k].y=c[i].y+1;
		}
	}
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			if(a[i][j]==b[i][j])
				if(a[i][j]<min)
					min=a[i][j],x=i,y=j;
	fcout<<min+1<<" "<<x<<" "<<y;
	return 0;
}