#include<fstream>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int m,n,i,j,k,nr,tmin,p1,p2,a[103][103],b[103][103];
char p;
int main()
{f>>n>>m;
nr=0;
f.get();
for (i=1;i<=n;i++)
	{for (j=1;j<=m;j++)
		{f.get(p);
		if (p=='J')
			a[i][j]=1;
		if (p=='R')
			b[i][j]=1;
		if (p=='X')
			{a[i][j]=-1;
			b[i][j]=-1;
			}
		if (p==32)
			{a[i][j]=0;
			b[i][j]=0;
			}
		}
	f.get();
	}
k=1;
while (1)
	{for (i=1;i<=n;i++)
		for (j=1;j<=m;j++)
			{if (a[i][j]==k)
				{if (a[i-1][j]==0)
					a[i-1][j]=k+1;
				if (a[i+1][j]==0)
					a[i+1][j]=k+1;
				if (a[i][j-1]==0)
					a[i][j-1]=k+1;
				if (a[i][j+1]==0)
					a[i][j+1]=k+1;
				if (a[i-1][j-1]==0)
					a[i-1][j-1]=k+1;
				if (a[i-1][j+1]==0)
					a[i-1][j+1]=k+1;
				if (a[i+1][j-1]==0)
					a[i+1][j-1]=k+1;
				if (a[i+1][j+1]==0)
					a[i+1][j+1]=k+1;
				}
			if (b[i][j]==k)
				{if (b[i-1][j]==0)
					b[i-1][j]=k+1;
				if (b[i+1][j]==0)
					b[i+1][j]=k+1;
				if (b[i][j-1]==0)
					b[i][j-1]=k+1;
				if (b[i][j+1]==0)
					b[i][j+1]=k+1;
				if (b[i-1][j-1]==0)
					b[i-1][j-1]=k+1;
				if (b[i-1][j+1]==0)
					b[i-1][j+1]=k+1;
				if (b[i+1][j-1]==0)
					b[i+1][j-1]=k+1;
				if (b[i+1][j+1]==0)
					b[i+1][j+1]=k+1;
				}
			if (a[i][j]==b[i][j]&&a[i][j]>0&&b[i][j]>0&&nr==0)
				{p1=i;
				p2=j;
				tmin=a[i][j];
				nr++;
				break;
				}
			}
	if (nr!=0)
		break;
	k++;
	}
g<<tmin<<" "<<p1<<" "<<p2<<'\n';
f.close();
g.close();
return 0;
}