#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

struct pereche
{
    int lin,col;
} start;

queue <pereche> c;

int minn=999999,ri,rj,jj,ji,i,j,n,m,v[101][101],a[101][101],pozi,pozj;
char s[150];
int dx[]= {0,0,1,-1,0};
int dy[]= {0,1,0,0,-1};
int interior(int i,int j)
{
    return  i <= n and i >= 1 and j <= m and j >= 1 ;
}
void leea(pereche start)
{
    int  i=start.lin;
    int  j=start.col;
    a[i][j]=1;
    c.push(start);
    while(!c.empty())
    {
        pereche varf =c.front();
        c.pop();
        i=varf.lin;
        j=varf.col;
        for(int k=1; k<=4; k++)
        {
            int ox=i+dx[k];
            int oy=j+dy[k];
            if(interior(ox,oy) and a[ox][oy]==0)
            {
                a[ox][oy]=a[i][j]+1;
                pereche vecin;
                vecin.lin=ox;
                vecin.col=oy;
                c.push(vecin);
            }
        }
    }
}
void leev(pereche start)
{
    int  i=start.lin;
    int  j=start.col;
    v[i][j]=1;
    c.push(start);
    while(!c.empty())
    {
        pereche varf =c.front();
        c.pop();
        i=varf.lin;
        j=varf.col;
        for(int k=1; k<=4; k++)
        {
            int ox=i+dx[k];
            int oy=j+dy[k];
            if(interior(ox,oy) and v[ox][oy]==0)
            {
                v[ox][oy]=v[i][j]+1;
                pereche vecin;
                vecin.lin=ox;
                vecin.col=oy;
                c.push(vecin);
            }
        }
    }
}
int main()
{
    f>>n>>m;
    f.getline(s,150);
    for(i=1; i<=n; i++)
    {
        f.getline(s,150);
        for(j=1; j<=m; j++)
        {
            if(s[j-1]==' ')
            {
                v[i][j]=0;
                a[i][j]=0;
            }
            else if(s[j-1]=='R')
            {
                ri=i;
                rj=j;
                v[i][j]=0;
                a[i][j]=0;
            }
            else if(s[j-1]=='J')
            {

                ji=i;
                jj=j;
                v[i][j]=0;
                a[i][j]=0;
            }
            else
            {
                v[i][j]=-1;
                a[i][j]=-1;
            }
        }
    }
    start.lin=ri;
    start.col=rj;
    leev(start);
    start.lin=ji;
    start.col=jj;
    leea(start);
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
            if(v[i][j]==a[i][j])
            {
                if(v[i][j]<minn and v[i][j]>0)
                {
                    minn=v[i][j];
                    pozi=i;
                    pozj=j;
                }
            }
            g<<minn-1<<" "<<pozi<<" "<<pozj;
}