#include <fstream>
#include <queue>
using namespace std;
char mat[105][105];
int distr[105][105];
int distj[105][105];

int n, m, k = 1;

void lee(pair <int, int> start){
    const int dx[] = {0, 0, 1, 1, -1, -1, -1, 1};
    const int dy[] = {-1, 1, -1, 1, 1, -1, 0, 0};
    queue <pair <int, int>> Q;
    Q.push(start);
    if(k == 1){
        distr[start.first][start.second] = 1;
    }
    else if(k == 2){
        distj[start.first][start.second] = 1;
    }
    auto isInside = [&n](const pair<int, int>& cell) -> bool {
        return 1 <= cell.first and cell.first <= n and 1 <= cell.second and cell.second <= n;
    };
    while(!Q.empty()){
        auto cell = Q.front();
        Q.pop();
        for(int direction = 0; direction <= 7; ++ direction){
            pair <int, int> x = {cell.first + dx[direction], cell.second + dy[direction]};
            if(!isInside(x) || mat[x.first][x.second] == 'X'){
                continue;
            }
            if(k == 1){
                if(distr[x.first][x.second] == 0){
                    distr[x.first][x.second] = distr[cell.first][cell.second] + 1;
                    Q.push(x);
                }
            }
            else {
                if(distj[x.first][x.second] == 0){
                    distj[x.first][x.second] = distj[cell.first][cell.second] + 1;
                    Q.push(x);
                }
            }
        }
    }
    k ++;
}

ifstream cin("rj.in");
ofstream cout("rj.out");
int main()
{
    char ch;
    pair <int, int> startr;
    pair <int, int> startj;
    cin >> n >> m;
    cin.get();
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            ch = cin.get();
            mat[i][j] = ch;
            if(ch == 'R'){
                startr.first = i;
                startr.second = j;
            }
            else if(ch == 'J'){
                startj.first = i;
                startj.second = j;
            }
        }
        cin.get();
    }
    lee(startr);
    lee(startj);
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            if(distr[i][j] == distj[i][j] && distr[i][j] >= 1){
                cout << distr[i][j] << " " << i << " " << j;
                break;
            }
        }
    }
    return 0;
}