#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
int n, m, x, y, a, b, J[105][105], R[105][105], ox[] = {-1, -1, 1, 1, -1, 0, 1, 0}, oy[] = {-1, 1, -1, 1, 0, 1, 0, -1};
queue < pair <int, int> > q;
string s;
bool r_turn = true;

void readInput() {
    fin >> n >> m;
    fin.get();
    for (int i = 1; i <= n; ++i) {
        getline(fin, s);
        for (int j = 0; j < m; ++j) {
            if (s[j] == 'X') {
                R[i][j + 1] = -1;
                J[i][j + 1] = -1;
            }
            else if (s[j] == 'R')
                x = i, y = j + 1;
            else if (s[j] == 'J')
                a = i, b = j + 1;
        }
    }
    return;
}

void lee() {
    while (!q.empty()) {
        for (int i = 0; i < 8; ++i) {
            if (q.front().first + ox[i] < 1 || q.front().first + ox[i] > n || q.front().second + oy[i] < 1 || q.front().second + oy[i] > m)
                continue;
            if (r_turn && R[q.front().first + ox[i]][q.front().second + oy[i]] == 0) {
                R[q.front().first + ox[i]][q.front().second + oy[i]] = R[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first + ox[i], q.front().second + oy[i]));
            }
            else if (!r_turn && J[q.front().first + ox[i]][q.front().second + oy[i]] == 0) {
                J[q.front().first + ox[i]][q.front().second + oy[i]] = J[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first + ox[i], q.front().second + oy[i]));
            }
        }
        q.pop();
    }
    return;
}

int main() {
    readInput();
    R[x][y] = 1, J[a][b] = 1;
    q.push(make_pair(x, y));
    lee();
    r_turn = false;
    q.push(make_pair(a, b));
    lee();
    int minim = 1000000;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j) {
            if (R[i][j] > 0 && R[i][j] == J[i][j] && J[i][j] - 1 < minim)
                minim = J[i][j];
        }
    fout << minim << " ";
    bool stop = false;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (R[i][j] == minim && J[i][j] == R[i][j]) {
                fout << i << " " << j;
                stop = true;
                break;
            }
        }
        if (stop)
            break;
    }
    return 0;
}