//ALEX ENACHE

#include <fstream>
#include <queue>

using namespace std;

ifstream cin ("input");ofstream cout ("output");
//ifstream cin ("rj.in");ofstream cout ("rj.out");

const int inf = 1e9;

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

bool copac[105][105];
int dist[2][105][105]; //tip , i , j

queue <pair < int , int > > q;

int n , m;

void solve (pair < int , int > sursa , int tip){ //tip = 0/1 (Julieta/Romeo)
    q.push(sursa);
    dist[tip][sursa.first][sursa.second] = 1;

    while (!q.empty()){
        pair < int , int > pozCurenta = q.front();
        q.pop();

        for (int i=0; i<8; i++){
            int x = pozCurenta.first + dx[i];
            int y = pozCurenta.second + dy[i];
            if (x < 1 || y < 1 || x > n || y > m){ //sa nu ies din matrice
                continue;
            }
            if (copac[x][y]){ //sa nu fie copac
                continue;
            }
            if (dist[tip][x][y] != inf){ //a mai fost vizitat
                continue;
            }

            dist[tip][x][y] = dist[tip][pozCurenta.first][pozCurenta.second] + 1;
            q.push({x , y});
        }
    }
}

int main() {

    cin>>n>>m;

    string s;
    getline(cin , s); //iau ce ramane de pe prima linie dupa ce am citit numerele (practic doar mut cursorul in fisierul de citire)

    pair < int , int > J , R;

    for (int i=1; i<=n; i++){
        getline(cin , s); //iau fiecare linie
        for (int j=0; j<m; j++){
            if (s[j] == 'R'){
                R = {i , j+1}; //j+1 ca sa indexez de la 1 1
            }
            if (s[j] == 'J'){
                J = {i , j+1};
            }
            if (s[j] == 'X'){
                copac[i][j+1] = true;
            }
            dist[0][i][j+1] = inf; //pun inf pe toate patratelele
            dist[1][i][j+1] = inf;
        }
    }

    solve (J , 0);
    solve (R , 1);

    int MIN = inf;
    pair <int , int> ans;

    for (int i=1; i<=n; i++){
        for (int j=1; j<=m; j++){
            if (dist[0][i][j] == dist[1][i][j] && MIN > dist[0][i][j]){
                MIN = dist[0][i][j];
                ans = {i , j};
            }
        }
    }

    cout<<MIN<<" "<<ans.first<<" "<<ans.second<<'\n';

    return 0;
}