#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
int n, m, l, c, fin_i, fin_j, mt[105][105];
queue < pair <int, int> > q;
vector < pair <int, int> > dir;
string s;

void readInput() {
    char pos;
    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')
                mt[i][j + 1] = -1;
            else if (s[j] == 'R') {
                mt[i][j + 1] = 1;
                q.push(make_pair(i, j + 1));
            }
            else if (s[j] == 'J')
                fin_i = i, fin_j = j + 1;
        }
    }
    return;
}

int main() {
    readInput();
    dir.push_back(make_pair(1, 0)), dir.push_back(make_pair(-1, 0));
    dir.push_back(make_pair(0, 1)), dir.push_back(make_pair(0, -1));
    dir.push_back(make_pair(1, 1)), dir.push_back(make_pair(-1, -1));
    dir.push_back(make_pair(-1, 1)), dir.push_back(make_pair(1, -1));
    while (mt[fin_i][fin_j] == 0) {
        for (int i = 0; i < 8; ++i)
            if (q.front().first + dir[i].first >= 1 && q.front().first + dir[i].first <= n &&
                q.front().second + dir[i].second >= 1 && q.front().second + dir[i].second <= n &&
                mt[q.front().first + dir[i].first][q.front().second + dir[i].second] == 0) {
                mt[q.front().first + dir[i].first][q.front().second + dir[i].second] += mt[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first + dir[i].first, q.front().second + dir[i].second));
            }
        q.pop();
    }
    l = fin_i, c = fin_j;
    while (mt[l][c] != (mt[fin_i][fin_j] + 1) / 2) {
        for (int i = 0; i < 8; ++i)
            if (l + dir[i].first >= 1 && l + dir[i].first <= n && c + dir[i].second >= 1 &&
                c + dir[i].second <= n && mt[l + dir[i].first][c + dir[i].second] == mt[l][c] - 1) {
                l += dir[i].first, c += dir[i].second;
                break;
            }

    }
    fout << (mt[fin_i][fin_j] + 1) / 2 << " " << l << " " << c;
    return 0;
}