#include <fstream>
#define nmax 105
#define NV 8
using namespace std;

int n, m, xr, yr, xj, yj;
int dl[NV]={0, 1, 0, -1, -1, 1, -1, 1};
int dc[NV]={1, 0, -1, 0, -1, 1,  1,-1};
char A[nmax][nmax];
int r[nmax][nmax];
int j[nmax][nmax];

void citire ()
{
	ifstream fin("rj.in");
	int i, k;
	char c;
	fin >> n >> m;
	for (i = 0; i <= n+1; i++)
		A[i][0]=A[i][m+1]='X';
	for (i=0; i<=m+1; i++)
		A[0][i]=A[n+1][i]='X';
	fin.get(c);
	for (i=1; i<=n; i++)
	{	
		for (k=1; k<=m; k++)
		{
			fin.get(c); 
			A[i][k]=c;
			if (A[i][k]=='R') {xr=i; yr=k; A[i][k]=' ';}
			if (A[i][k]=='J') {xj=i; yj=k; A[i][k]=' ';}
		}
	fin.get(c);
	}
fin.close();
}

void parcurge (int x0, int y0, int d[nmax][nmax])
{
	struct Punct {int l, c;} C[nmax*nmax], p;
	int inc=0, sf=0, i, k;
	for (i=0; i<=n+1; i++)
		for (k=0; k<=m+1; k++) 
			d[i][k]=-1;
	C[0].l=x0; C[0].c=y0; d[x0][y0]=1;
	while (inc<=sf)
		{
		p=C[inc++];
		for (i=0; i<NV; i++)
			if (A[p.l+dl[i]][p.c+dc[i]]==' ' && d[p.l+dl[i]][p.c+dc[i]]==-1)
				{	
				d[p.l+dl[i]][p.c+dc[i]]=1+d[p.l][p.c];
				C[++sf].l=p.l+dl[i];
				C[sf].c=p.c+dc[i];
				}
		}
}

void afisare(int j[nmax][nmax])
{
	ofstream fout("rj.out");
	int tmin=nmax*nmax+5, xmin=-1, ymin=-1, i, k;
	for (i=1; i<=n; i++)
		for (k=1; k<=m; k++)
			if (r[i][k]==j[i][k])
				if (r[i][k]<tmin && r[i][k]!=-1)
					{tmin=r[i][k]; xmin=i; ymin=k;}
	fout << tmin << ' ' << xmin << ' '<< ymin << '\n';
	fout.close ();
}

int main()
{
	citire();
	parcurge(xr, yr, r);
    parcurge(xj, yj, j);
	afisare(j);
	return 0;
}