#include <stdio.h>
#include <string.h>
#include <values.h>
FILE *f=fopen ("rj.in", "r");
FILE *g=fopen ("rj.out", "w");
int i,n,m,ri,rj,vi,vj,j,pr,ult,sw,d=-1,t=99999;
char a[120];
int r[101][101],v[101][101];


void citire (void) {
int j;
fscanf (f, "%d%d", &n, &m);
fgets (a, 120, f);
for (i=1;i<=n;i++)
{
	fgets (a, 120, f);
	for (j=0;j<=strlen(a)-1;j++)
	{
		if ( a[j]=='R')
		{
			r[i][j+1]=1;
			ri=i;  rj=j+1;
		}
		if ( a[j]=='J')
		{
			v[i][j+1]=1;
			vi=i;  vj=j+1;
		}
		if ( a[j]=='X')
		{
			v[i][j+1]=d;
			r[i][j+1]=d;
		}
	}
}
}


int valid (int K, int v[101][101], int a, int b) 
{
if (K==1)
	if ( a>0 && b>0 && v[a][b]==0 )
		return 1;
if (K==2)
	if ( a>0 && b<=m && v[a][b]==0 )
		return 1;
if (K==3)
	if ( a<=n && b>0 && v[a][b]==0 )
		return 1;
if (K==4)
	if ( a<=n && b<=m && v[a][b]==0 )
		return 1;
if (K==5)
	if ( a>0 && v[a][b]==0 )
		return 1;
if (K==6)
	if ( a<=n && v[a][b]==0 )
		return 1;
if (K==7)
	if ( b>0 && v[a][b]==0 )
		return 1;
if (K==8)
	if ( b<=m && v[a][b]==0 )
		return 1;
return 0;
}



void Lee (int pi, int pj, int v[101][101]) {
int a,b;
struct coada {int x,y; } c[101*101];
memset (c, 0, sizeof(c));

pr=1;  ult=1;
c[pr].x=pi;  c[pr].y=pj;

while (pr<=ult)
{
	a=c[pr].x-1;  b=c[pr].y-1;
	if ( valid (1, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x-1;  c[ult].y=c[pr].y-1;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x-1;  b=c[pr].y+1;
	if ( valid (2, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x-1;  c[ult].y=c[pr].y+1;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x+1;  b=c[pr].y-1;
	if ( valid (3, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x+1;  c[ult].y=c[pr].y-1;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x+1;  b=c[pr].y+1;
	if ( valid (4, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x+1;  c[ult].y=c[pr].y+1;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x-1;  b=c[pr].y;
	if ( valid (5, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x-1;  c[ult].y=c[pr].y;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x+1;  b=c[pr].y;
	if ( valid (6, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x+1;  c[ult].y=c[pr].y;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x;  b=c[pr].y-1;
	if ( valid (7, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x;  c[ult].y=c[pr].y-1;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
	a=c[pr].x;  b=c[pr].y+1;
	if ( valid (8, v, a ,b) )
	{
		ult++;  c[ult].x=c[pr].x;  c[ult].y=c[pr].y+1;
		v[c[ult].x][c[ult].y] = v[c[pr].x][c[pr].y]+1;
	}
pr++;
}
}


int main() {
	
citire();
Lee(ri, rj, r);
Lee(vi, vj, v);

for (i=1;i<=n && !sw;i++)
	for (j=1;j<=m;j++)
		if (r[i][j]==v[i][j])
			if (r[i][j] && r[i][j]!=d)
				if (t>r[i][j])
				{
					t=r[i][j];
					ri=i;
					rj=j;
				}
fprintf (g, "%d %d %d", t, ri, rj);
return 0;
}