#include<bits/stdc++.h>

#define x first
#define y second

using namespace std;

const int NMAX=105;

const int dx[]={0,0,1,1,1,-1,-1,-1};
const int dy[]={1,-1,0,1,-1,0,1,-1};

queue<pair<int, int> > q;
int viz[2][NMAX][NMAX],n,m;

bool verif(int x, int y, int d){
    if(x>0 && y>0 && x<=n && y<=m && viz[d][x][y]==0)
        return 1;
    return 0;
}

void Lee(int x, int y, int d){
    viz[d][x][y]=1;
    q.push(make_pair(x, y));
    while(!q.empty()){
        pair<int, int> temp;
        temp=q.front();
        q.pop();
        for(int dd=0;dd<8;dd++){
            int xx=temp.x+dx[dd];
            int yy=temp.y+dy[dd];
            if(verif(xx, yy, d)){
                q.push(make_pair(xx, yy));
                viz[d][xx][yy]=viz[d][temp.x][temp.y]+1;
            }
        }
    }
}

int main(){
    freopen("rj.in","r",stdin);
    freopen("rj.out","w",stdout);
    int rx,ry,jx,jy;
    scanf("%d%d\n", &n, &m);
    for(int i=1;i<=n;i++){
        char s[NMAX];
        fgets(s, NMAX, stdin);
        for(int j=1;j<=m;j++){
            if(s[j-1]=='R')
                rx=i,ry=j;
            if(s[j-1]=='J')
                jx=i,jy=j;
            if(s[j-1]=='X')
                viz[0][i][j]=viz[1][i][j]=-1;
        }
    }
    Lee(rx, ry, 0);
    Lee(jx, jy, 1);
    int tmin=NMAX*NMAX,x=-1,y=-1;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(viz[0][i][j]==viz[1][i][j]){
                if(viz[0][i][j]<tmin && viz[0][i][j]>0)
                    tmin=viz[0][i][j],x=i,y=j;
                else if(viz[0][i][j]==tmin){
                    if(i<x)
                        x=i,y=j;
                    else if(i==x)
                        y=min(y, j);
                }
            }
    printf("%d %d %d", tmin, x, y);
    return 0;
}