#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
int main() {
    int n, m;
    fin >> n >> m;

    char a[105][105];
    int dr[105][105], dj[105][105];
    int rx, ry, jx, jy;
    const int INF = 1000000000;
    int dx[8] = {-1,-1,-1,0,0,1,1,1};
    int dy[8] = {-1,0,1,-1,1,-1,0,1};
    // Citire matrice și găsire poziții R, J
    for (int i = 1; i <= n; i++) {
        for (int j=i; j <= m; j++) {
            fin >> a[i][j];
            if (a[i][j] == 'R') { rx = i; ry = j; }
            if (a[i][j] == 'J') { jx = i; jy = j; }
        }
    }
    // Inițializare distanțe
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            dr[i][j] = dj[i][j] = INF;

    // --- Romeo ---
    int qx[10005], qy[10005];
    int st = 0, drq = 0;
    qx[drq] = rx; qy[drq] = ry; drq++;
    dr[rx][ry] = 0;

    while (st < drq) {
        int x = qx[st];
        int y = qy[st];
        st++;
        for (int d = 0; d < 8; d++) {
            int nx = x + dx[d];
            int ny = y + dy[d];
            if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && a[nx][ny] != 'X' && dr[nx][ny] == INF) {
                dr[nx][ny] = dr[x][y] + 1;
                qx[drq] = nx; qy[drq] = ny; drq++;
            }
        }
    }

    // --- Julieta ---
    st = drq = 0;
    qx[drq] = jx; qy[drq] = jy; drq++;
    dj[jx][jy] = 0;

    while (st < drq) {
        int x = qx[st];
        int y = qy[st];
        st++;
        for (int d = 0; d < 8; d++) {
            int nx = x + dx[d];
            int ny = y + dy[d];
            if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && a[nx][ny] != 'X' && dj[nx][ny] == INF) {
                dj[nx][ny] = dj[x][y] + 1;
                qx[drq] = nx; qy[drq] = ny; drq++;
            }
        }
    }

    // --- Căutare punct de întâlnire ---
    int bestT=INF, bestX=-1, bestY=-1;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (dr[i][j] == dj[i][j] && dr[i][j] != INF)
            {
                if (dr[i][j] < bestT ||
                   (dr[i][j] == bestT && (i < bestX || (i == bestX && j < bestY))))
                   {
                        bestT = dr[i][j];
                        bestX = i-1;
                        bestY = j;
                    }
            }
        }
    }

    fout << bestT << " " << bestX << " " << bestY;
    return 0;
}