#include<iostream>
#include<fstream>
#include<string.h>
#include<queue>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
queue<int>ox;
queue<int>oy;
int main()
{
    char b[100];
    int a[100][100],d[100][100],c[4],i,j,n,m,xx,yy,x1,x2,y1,y2,cx,cy;
    f>>n>>m;
    f.get();
    int l=n;
    for(i=1;i<=l;i++){
                    f.get(b,100);
                    f.get();
                    for(j=0;j<strlen(b);j++){
                                            if(b[j]==' ') d[i][j+1]=a[i][j+1]=0;
                                            if(b[j]=='R') {x1=i;y1=j+1;}
                                            if(b[j]=='J') {x2=i;y2=j+1;}
                                            if(b[j]=='X') d[i][j+1]=a[i][j+1]=-1;
                                            }
                    }

    i=0;for(j=0;j<=m+1;j++) d[i][j]=a[i][j]=-1;
    i=n+1;for(j=0;j<=m+1;j++) d[i][j]=a[i][j]=-1;
    i=0;for(j=0;j<=n+1;j++) d[j][i]=a[j][i]=-1;
    i=m+1;for(j=0;j<=n+1;j++) d[j][i]=a[j][i]=-1;



    ox.push(x1);
    oy.push(y1);
    while(ox.empty()!=true){
                            xx=ox.front();
                            yy=oy.front();
                            if(a[xx-1][yy-1]==0 || a[xx-1][yy-1]>a[xx][yy]+1){
                                                                            a[xx-1][yy-1]=a[xx][yy]+1;
                                                                            ox.push(xx-1);
                                                                            oy.push(yy-1);
                                                                            }
                           if(a[xx-1][yy+1]==0 || a[xx-1][yy+1]>a[xx][yy]+1){
                                                                            a[xx-1][yy+1]=a[xx][yy]+1;
                                                                            ox.push(xx-1);
                                                                            oy.push(yy+1);
                                                                            }
                          if(a[xx+1][yy+1]==0 || a[xx+1][yy+1]>a[xx][yy]+1){
                                                                            a[xx+1][yy+1]=a[xx][yy]+1;
                                                                            ox.push(xx+1);
                                                                            oy.push(yy+1);
                                                                            }
                          if(a[xx+1][yy-1]==0 || a[xx+1][yy-1]>a[xx][yy]+1){
                                                                            a[xx+1][yy-1]=a[xx][yy]+1;
                                                                            ox.push(xx+1);
                                                                            oy.push(yy-1);
                                                                            }
                          if(a[xx-1][yy]==0 || a[xx-1][yy]>a[xx][yy]+1){
                                                                        a[xx-1][yy]=a[xx][yy]+1;
                                                                        ox.push(xx-1);
                                                                        oy.push(yy);
                                                                        }
                          if(a[xx+1][yy]==0 || a[xx+1][yy]>a[xx][yy]+1){
                                                                        a[xx+1][yy]=a[xx][yy]+1;
                                                                        ox.push(xx+1);
                                                                        oy.push(yy);
                                                                        }
                         if(a[xx][yy-1]==0 || a[xx][yy-1]>a[xx][yy]+1){
                                                                        a[xx][yy-1]=a[xx][yy]+1;
                                                                        ox.push(xx);
                                                                        oy.push(yy-1);
                                                                        }
                          if(a[xx][yy+1]==0 || a[xx][yy+1]>a[xx][yy]+1){
                                                                        a[xx][yy+1]=a[xx][yy]+1;
                                                                        ox.push(xx);
                                                                        oy.push(yy+1);
                                                                        }

                            ox.pop();
                            oy.pop();
                            }
    ox.push(x2);
    oy.push(y2);
    while(ox.empty()!=true){
                            xx=ox.front();
                            yy=oy.front();
                            if(d[xx-1][yy-1]==0 || d[xx-1][yy-1]>d[xx][yy]+1){
                                                                            d[xx-1][yy-1]=d[xx][yy]+1;
                                                                            ox.push(xx-1);
                                                                            oy.push(yy-1);
                                                                            }
                           if(d[xx-1][yy+1]==0 || d[xx-1][yy+1]>d[xx][yy]+1){
                                                                            d[xx-1][yy+1]=d[xx][yy]+1;
                                                                            ox.push(xx-1);
                                                                            oy.push(yy+1);
                                                                            }
                          if(d[xx+1][yy+1]==0 || d[xx+1][yy+1]>d[xx][yy]+1){
                                                                            d[xx+1][yy+1]=d[xx][yy]+1;
                                                                            ox.push(xx+1);
                                                                            oy.push(yy+1);
                                                                            }
                          if(d[xx+1][yy-1]==0 || d[xx+1][yy-1]>d[xx][yy]+1){
                                                                            d[xx+1][yy-1]=d[xx][yy]+1;
                                                                            ox.push(xx+1);
                                                                            oy.push(yy-1);
                                                                            }
                          if(d[xx-1][yy]==0 || d[xx-1][yy]>d[xx][yy]+1){
                                                                        d[xx-1][yy]=d[xx][yy]+1;
                                                                        ox.push(xx-1);
                                                                        oy.push(yy);
                                                                        }
                          if(d[xx+1][yy]==0 || d[xx+1][yy]>d[xx][yy]+1){
                                                                        d[xx+1][yy]=d[xx][yy]+1;
                                                                        ox.push(xx+1);
                                                                        oy.push(yy);
                                                                        }
                         if(d[xx][yy-1]==0 || d[xx][yy-1]>d[xx][yy]+1){
                                                                        d[xx][yy-1]=d[xx][yy]+1;
                                                                        ox.push(xx);
                                                                        oy.push(yy-1);
                                                                        }
                          if(d[xx][yy+1]==0 || d[xx][yy+1]>d[xx][yy]+1){
                                                                        d[xx][yy+1]=d[xx][yy]+1;
                                                                        ox.push(xx);
                                                                        oy.push(yy+1);
                                                                        }

                            ox.pop();
                            oy.pop();
                            }
    int min=3200;
    for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(a[i][j]==d[i][j] && a[i][j]>0 && a[i][j]+1<min) {min=a[i][j]+1;cx=i;cy=j;}
    g<<min<<" "<<cx<<" "<<cy;

}