program romeojulieta;
uses math;
var  a:array[1..100,1..100]of char;
        n,m,j,i,jy,jx,ry,rx,mini,x,y:longint;
begin
assign(input,'rj.in');reset(input);
readln(n,m);
for i:=1 to n do begin
        for j:=1 to m do begin
                read(a[i,j]);
                if a[i,j]='R' then begin rx:=i;ry:=j;end;
                if a[i,j]='J' then begin jx:=i;jy:=j; end;
                end;
        readln;
        end;
mini:=maxlongint;
for i:=1to  n do for j:=1 to m do
if a[i,j]<>'X' then if( max(abs(rx-i),abs(ry-j))=max(abs(jx-i),abs(jy-j)))then if max(abs(rx-i),abs(ry-j))<mini then begin
                                        x:=i;
                                        y:=j;
                                        mini:=max(abs(rx-i),abs(ry-j));
                                        end;
assign(output,'rj.out');rewrite(output);
writeln(mini+1,' ',x,' ',y);
close(output);
end.