#include <bits/stdc++.h>

using namespace std;

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

int n, m;
char a[105][105];

int dR[105][105];
int dJ[105][105];
int dx[8]={-1,-1,-1,0,0,1,1,1};
int dy[8]={-1,0,1,-1,1,-1,0,1};
void bfs(int xs, int ys, int d[][105])
{
    queue<pair<int,int>> q;
    d[xs][ys]=1;
    q.push({xs,ys});
    while(!q.empty())
    {
        int x=q.front().first;
        int y=q.front().second;
        q.pop();
        for(int k=0;k<8;k++)
        {
            int nx=x+dx[k];
            int ny=y+dy[k];
            if(nx<1 || nx>n || ny<1 || ny>m)
            {
                continue;
            }
            if(a[nx][ny]=='X')
            {
                continue;
            }
            if(d[nx][ny])
            {
                continue;
            }
            d[nx][ny]=d[x][y]+1;
            q.push({nx, ny});
        }
    }
}

int main()
{
    in>>n>>m;
    int rx,ry,jx,jy;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            in.get(a[i][j]);
            if(a[i][j]=='R')
            {
                rx=i;
                ry=j;
            }
            if(a[i][j]=='J')
            {
                jx=i;
                jy=j;
            }
        }
        in.get();
    }
    bfs(rx, ry, dR);
    bfs(jx, jy, dJ);
    int tmin=INT_MAX;
    int solx=0;
    int soly=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(dR[i][j]==0 || dJ[i][j]==0)
            {
                continue;
            }
            if(dR[i][j]!=dJ[i][j])
            {
                continue;
            }
            int t=dR[i][j];
            if(t<tmin)
            {
                tmin=t;
                solx=i;
                soly=j;
            }
            else if(t==tmin)
            {
                if(i<solx || (i==solx && j<soly))
                {
                    solx=i;
                    soly=j;
                }
            }
        }
    }
    out<<tmin<<" "<<solx<<" "<<soly;
    return 0;
}