#include <fstream>
#include <queue>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
int dx[]= {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[]= {0, 1, 1, 1, 0, -1, -1, -1};
int n, m, nr=99999, l, c;
char a[101][101];
int rl[101][101], jl[101][101];
pair <int, int> rstart, jstart;
bool check(int i, int j)
{
    return (i>=0 && j>=0 && i<n && j<m);
}
void lee(int t[101][101], pair <int, int> start)
{
    queue <pair <int, int> > q;
    pair <int, int> current;
    int nx, ny;
    q.push(start);
    t[start.first][start.second]=1;
    while(!q.empty())
    {
        current=q.front();
        q.pop();
        for(int i=0; i<8; ++i)
        {
            nx=current.first+dx[i];
            ny=current.second+dy[i];
            if(check(nx, ny))
            {
                if(a[nx][ny]!='X' && t[nx][ny]==-1)
                {
                    t[nx][ny]=t[current.first][current.second]+1;
                    q.push(make_pair(nx,ny));
                }
            }
        }
    }
}
int main()
{
    in>>n>>m;
    char c=in.get();
    out<<c;

    char s[101];
    for(int i=0; i<n; i++)
    {
        in.getline(s,sizeof(s));
        for(int j=0; j<m; j++)
        {
            a[i][j]=s[j];
            if(a[i][j]=='R')
            {
                rstart=make_pair(i,j);
            }
            if(a[i][j]=='J')
            {
                jstart=make_pair(i,j);
            }
            rl[i][j]=jl[i][j]=-1;
        }
    }
    lee(rl,rstart);
    lee(jl,jstart);
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<m; j++)
        {
            if(rl[i][j]==jl[i][j] && rl[i][j]!=-1)
            {
                if(rl[i][j]<nr)
                {
                    nr=rl[i][j];
                    l=i;
                    c=j;
                }
            }
        }
    }
    out<<nr<<" "<<l+1<<" "<<c+1;
    return 0;
}