#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
int n, m, l, c;
queue < pair <int, int> > r_road, j_road;
vector < pair <int, int> > v;
string s;
bool they_met = false;

struct specialMatrix {
    int dist;
    char person;
}mt[105][105];

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')
                mt[i][j + 1].dist = -1;
            else if (s[j] == 'R') {
                mt[i][j + 1].dist = 1;
                mt[i][j + 1].person = 'R';
                r_road.push(make_pair(i, j + 1));
            }
            else if (s[j] == 'J') {
                mt[i][j + 1].dist = 1;
                mt[i][j + 1].person = 'J';
                j_road.push(make_pair(i, j + 1));
            }
        }
    }
    return;
}

void moveR() {
    bool a_mers = false;
    for (int i = 0; i < 8; ++i) {
        int pos_x = r_road.front().first + v[i].first, pos_y = r_road.front().second + v[i].second;
        if (pos_x < 1 || pos_x > n || pos_y < 1 || pos_y > m)
            continue;
        char lit = mt[pos_x][pos_y].person;
        int val = mt[pos_x][pos_y].dist;
        if(val == 0) {
            r_road.push(make_pair(pos_x, pos_y));
            mt[pos_x][pos_y].dist += mt[r_road.front().first][r_road.front().second].dist + 1;
            mt[pos_x][pos_y].person = 'R';
            a_mers = true;
        }
        else if (lit == 'J') {
            they_met = true;
            a_mers = true;
            mt[pos_x][pos_y].dist += mt[r_road.front().first][r_road.front().second].dist + 1;
            l = pos_x;
            c = pos_y;
            break;
        }
    }
    r_road.pop();
    if (!a_mers)
        moveR();
    return;
}

void moveJ() {
    bool a_mers = false;
    for (int i = 0; i < 8; ++i) {
        int pos_x = j_road.front().first + v[i].first, pos_y = j_road.front().second + v[i].second;
        if (pos_x < 1 || pos_x > n || pos_y < 1 || pos_y > m)
            continue;
        char lit = mt[pos_x][pos_y].person;
        int val = mt[pos_x][pos_y].dist;
        if(val == 0) {
            a_mers = true;
            j_road.push(make_pair(pos_x, pos_y));
            mt[pos_x][pos_y].dist += mt[j_road.front().first][j_road.front().second].dist + 1;
            mt[pos_x][pos_y].person = 'J';
        }
        else if (lit == 'R') {
            they_met = true;
            a_mers = true;
            mt[pos_x][pos_y].dist += mt[j_road.front().first][j_road.front().second].dist + 1;
            l = pos_x;
            c = pos_y;
            break;
        }
    }
    j_road.pop();
    if (!a_mers)
        moveJ();
    return;
}

int main() {
    readInput();
    v.push_back(make_pair(1, 0)), v.push_back(make_pair(-1, 0));
    v.push_back(make_pair(0, 1)), v.push_back(make_pair(0, -1));
    v.push_back(make_pair(1, 1)), v.push_back(make_pair(-1, -1));
    v.push_back(make_pair(-1, 1)), v.push_back(make_pair(1, -1));
    while (!r_road.empty() && !j_road.empty() && they_met == false) {
        moveR();
        if(!they_met)
            moveJ();
    }
    fout << mt[l][c].dist / 2 << " " << l << " " << c;
    return 0;
}