#include <bits/stdc++.h>

using namespace std;

int n , m;
int dx[] = {-1,-1,-1,0,1,1,1,0};
int dy[] = {-1,0,1,1,1,0,-1,-1};
int A[105][105];
int R[105][105];
int J[105][105];
int viz[105][105];
char str[105];
int rj , ri , juj , jui;


int main()
{
    freopen("rj.in" , "r" , stdin);
    freopen("rj.out" , "w" , stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n >> m;
    cin.get();
    for(int i = 1;i <= n; ++i){
    cin.getline(str,101);
    int f = strlen(str);
    cerr << f;
    while(f < m)str[f++] = ' ';
        for(int j = 1;j <= m; ++j){
            char x = str[j - 1];
            if(x == 'R')ri = i, rj = j;
            else if(x == 'J')jui = i, juj = j;
                    else if(x == 'X')A[i][j] = -1;
        }
//cout << str << "\n";
    }
    auto good = [&](int x,int y){
    return x >= 1 && x <= n && y >= 1 && y <= m && !viz[x][y] && A[x][y] != -1;
    };
    auto bfs = [&](int B[105][105],int x ,int y){
    memset(viz,0,sizeof(viz));
    queue <pair<int,int>> q;
    q.push({x,y});
    viz[x][y] = 1;
    B[x][y] = 1;
    while(!q.empty()){
        auto p = q.front();
        q.pop();
        for(int f = 0;f < 8; ++f){
            int i = p.first + dx[f];
            int j = p.second + dy[f];
            if(good(i,j)){
                B[i][j] = B[p.first][p.second] + 1;
                viz[i][j] = 1;
                q.push({i,j});
            }
        }
    }
    };
    bfs(R,ri,rj);
    bfs(J,jui,juj);
    auto af = [&](int B[105][105]){
    for(int i = 1;i <= n; ++i)
        for(int j = 1;j <= m; ++j)
            cout << B[i][j] << " \n"[j == m];
    cout << "\n";
    };
    int minn = 1e9, minni , minnj;
    for(int i = 1;i <= n; ++i)
        for(int j = 1;j <= m; ++j)
            if(R[i][j] == J[i][j] && R[i][j])
                if(R[i][j] < minn){
                    minn = R[i][j];
                    minni = i;
                    minnj = j;
                }
   // af(R);
   // af(J);
    cout << minn << " " << minni << " " << minnj;
}