#include <fstream>
#include <iostream>
#include <queue>
#include <cstring>
#define inf 1000000000

using namespace std;

ifstream f("rj.in");
ofstream g("rj.out");

int n, m, A[101][101], sol[101][101], val=inf;
bool b[101][101];
int dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
char a[101][101], s[101];
pair <int, int> R, J, poz;
queue <pair <int, int> > Q;

void Lee(char c)
{
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) A[i][j] = inf;

    memset(b, 0, sizeof(b));
    if(c == 'R')  Q.push(R), b[R.first][R.second] = 1, A[R.first][R.second] = 1;
    else Q.push(J), b[J.first][J.second] = 1, A[J.first][J.second] = 1;

    while(!Q.empty())
        {   pair <int, int> var = Q.front();
            Q.pop();
            for(int t=0; t<8; t++)
                {   pair<int, int> vec;
                    vec.first = var.first + dx[t];
                    vec.second = var.second + dy[t];
                    if(a[vec.first][vec.second] != 'X' && !b[vec.first][vec.second] && vec.first > 0 && vec.first <= n
                       && vec.second > 0 && vec.second <= m)
                        {   b[vec.first][vec.second] = 1;
                            A[vec.first][vec.second] = min(A[vec.first][vec.second], A[var.first][var.second]+1);
                            if(!sol[vec.first][vec.second]) sol[vec.first][vec.second] = A[vec.first][vec.second];
                            else if(sol[vec.first][vec.second] != A[vec.first][vec.second]) sol[vec.first][vec.second] = 0;
                            Q.push(vec);
                        }
                }
        }
}

int main()
{
    f >> n >> m;
    f.get();
    for(int i=1; i<=n; i++)
        {   f.getline(s, 105);
            for(int j=0; j<m; j++)
                {   a[i][j+1] = s[j];
                    if(a[i][j+1] == 'R') R.first = i, R.second = j+1, A[i][j+1] = 1;
                    else if(a[i][j+1] == 'J') J.first = i, J.second = j+1, A[i][j+1] = 1;
                }
        }
    Lee('R');
    Lee('J');
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            if(sol[i][j] && sol[i][j] < val)
                {   val = sol[i][j];
                    poz.first = i;
                    poz.second = j;
                }
    g << val << ' ' << poz.first << ' ' << poz.second << '\n';
    return 0;
}