program alex;
const b:array[1..8]of -1..1=(-1,-1,0,1,1,1,0,-1);
      d:array[1..8]of -1..1=(0,1,1,1,0,-1,-1,-1);
var a:array[1..101,1..101]of longint;
    f:text;
    q:string;
    e:boolean;
    m,n,i,j,x,y,l,c,k,h,w,mink,minl,minc:longint;
begin
assign(f,'rj.in');reset(f);
readln(f,m,n);
for i:=1 to m do
    begin
    readln(f,q);
    j:=0;
    for h:=1 to length(q) do
        case q[h] of
        ' ':begin
            j:=j+1;
            a[i,j]:=-1;
            end;
        'X':begin
            j:=j+1;
            a[i,j]:=-2;
            end;
        'R':begin
            j:=j+1;
            x:=i;
            y:=j;
            end;
        'J':begin
            j:=j+1;
            l:=i;
            c:=j;
            end;
        end;
        if length(q)<n then for h:=length(q)+1 to n do
                                begin
                                j:=j+1;
                                a[i,j]:=-1;
                                end;
        end;
close(f);
a[x,y]:=0;
a[l,c]:=0;
k:=0;
mink:=999999999;
minl:=4000;
minc:=4000;
repeat
e:=false;
for i:=1 to m do
    for j:=1 to n do
        if a[i,j]=k then begin
                         for h:=1 to 8 do
                             if a[i+b[h],j+d[h]]=-1 then begin
                                                         a[i+b[h],j+d[h]]:=k+1;
                                                         e:=true;
                                                         end
                                                   else if k+1=a[i+b[h],j+d[h]] then begin
                                                                                     if k+1<mink then begin
                                                                                                     mink:=k+1;
                                                                                                     minl:=i+b[h];
                                                                                                     minc:=j+d[h];
                                                                                                     end
                                                                                                else if k+1=mink then
                                                                                                if i+b[h]<minl then begin
                                                                                                minl:=i+b[h];
                                                                                                minc:=j+d[h];
                                                                                                end
                                                                                                else if i+b[h]=minl then
                                                                                                if j+d[h]<minc then
                                                                                                minc:=j+d[h];
                                                                                     end;

                         end;
k:=k+1;
until(e=false)or(w=1);
assign(f,'rj.out');rewrite(f);
writeln(f,mink,' ',minl,' ',minc);
close(f);
end.