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,min: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 j:=1 to length(q) do
        case q[j] of
        ' ':a[i,j]:=-1;
        'X':a[i,j]:=-2;
        'R':begin
            x:=i;
            y:=j;
            end;
        'J':begin
            l:=i;
            c:=j;
            end;
        end;
        if length(q)<n then for j:=length(q)+1 to n do
                                a[i,j]:=-1;

        end;
close(f);
a[x,y]:=1;
k:=1;
repeat
e:=false;
for i:=1 to m do
    begin
    for j:=1 to n do
        begin
        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(i+b[h]=l)and(j+d[h]=c)then begin
                                                                                        w:=1;
                                                                                        break;
                                                                                        end;

                          end;
       if w=1 then break;
       end;
    if w=1 then break;
    end;
k:=k+1;
until(e=false);
min:=(k+1) div 2;
l:=500000;
c:=500000;
for i:=1 to m do
    for j:=1 to n do
        if a[i,j]=min then if i<l then begin
                                       l:=i;
                                       c:=j;
                                       end
                                  else if i=l then if j<c then c:=j;
assign(f,'rj.out');rewrite(f);
writeln(f,min,' ',l,' ',c);
close(f);
end.