#include <bits/stdc++.h>
using namespace std;

ifstream fin("rj.in");
ofstream fout("rj.out");

queue < pair < int, int > > q;
int n, m, sr[105][105], sj[105][105];
int x, y, timp=1010, ri, rj, ji, jj;
char s[105];

int di[8]={0, 0, -1, 1, -1, 1, -1, 1};
int dj[8]={-1, 1, 0, 0, -1, -1, 1, 1};

void lee(int i, int j, int mat[105][105]){
    q.push(make_pair(i, j));
    int sf=1,inc=1;
    mat[i][j]=1;
    while(inc<=sf){
        int i=q.front().first;
        int j=q.front().second;
        q.pop();
        for(int k=0;k<8;k++){
            int ni=i+di[k];
            int nj=j+dj[k];
            if(mat[ni][nj]!=-1 && mat[ni][nj]==0){
                sf++;
                mat[ni][nj]=mat[i][j]+1;
                q.push(make_pair(ni, nj));
            }
        }
        inc++;
    }
}

void bordare(){
    for(int i = 0; i <= n + 1; i++) {
        sr[i][0] = -1;
        sj[i][0] = -1;
        sr[i][m+1] = -1;
        sj[i][m+1] = -1;
    }
    for(int j = 0; j <= m + 1; j++) {
        sr[0][j] = -1;
        sj[0][j] = -1;
        sr[n+1][j] = -1;
        sj[n+1][j] = -1;
    }
}

int main(){
    fin>>n>>m;
    fin.getline(s, 101);
    for(int i=1;i<=n;i++){
        fin.getline(s, 101);
        for(int j=1;j<=m;j++){
            if(s[j-1]=='R'){
                ri=i;
                rj=j;
            }else if(s[j-1]=='J'){
                ji=i;
                jj=j;
            }else if(s[j-1]=='X'){
                sr[i][j] = sj[i][j] = -1;
            }else{
                sr[i][j] = sj[i][j] = 0;
            }
        }
    }
    bordare();
    lee(ri,rj,sr);
    lee(ji,jj,sj);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(sr[i][j]==sj[i][j] && sj[i][j]>0 && sj[i][j]<timp){
                    timp = sj[i][j];
                    x = i;
                    y = j;
            }
        }
    }
    fout<<timp<<" "<<x<<" "<<y;
    return 0;
}