#include <fstream>
#include <deque>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int a[102][102],dl[]={1,1,1,0,-1,-1,-1,0},dc[]={-1,0,1,1,1,0,-1,-1},b[102][102],v[102][102],n,m;
int sf,inc,nrmin=10201,L,C,l,c;
struct coada
{int lin,col;};
coada p;
deque<coada>cr;
deque<coada>cj;
void citire()
{
    char x;
    int i=1,j=1;
    f>>noskipws>>x;
    while(f>>noskipws>>x)
        if(x=='\n')
        {i++;j=1;}
        else
        {
            if(x=='X')
                a[i][j]=-1;
            else if(x=='J')
            {
                 a[i][j]=1;
                 p.lin=i;
                 p.col=j;
                 cj.push_back(p);
                 v[i][j]=1;
            }
            else if(x=='R')
            {
                a[i][j]=1;
                p.lin=i;
                p.col=j;
                cr.push_back(p);
                b[i][j]=1;
            }
            j++;
        }
}
void bordare()
{
    for(int i=0;i<=n+1;i++)
        a[i][0]=a[i][m+1]=-1;
    for(int i=0;i<=m+1;i++)
        a[0][i]=a[n+1][i]=-1;
}
void lee ()
{
    inc=1;
    while(!cr.empty())
    {
        l=cr[0].lin;c=cr[0].col;
        for(int k=0;k<8;k++)
            if(a[l+dl[k]][c+dc[k]]==0&&b[l+dl[k]][c+dc[k]]==0)
            {
                b[l+dl[k]][c+dc[k]]=b[l][c]+1;
                inc++;
                p.lin=l+dl[k];
                p.col=c+dc[k];
                cr.push_back(p);
            }
        cr.pop_front();
    }
    sf=1;
    while(!cj.empty())
    {
        l=cj[0].lin;c=cj[0].col;
        for(int k=0;k<8;k++)
            if(a[l+dl[k]][c+dc[k]]==0&&v[l+dl[k]][c+dc[k]]==0)
            {
                v[l+dl[k]][c+dc[k]]=v[l][c]+1;
                sf++;
                p.lin=l+dl[k];
                p.col=c+dc[k];
                cj.push_back(p);
            }
        cj.pop_front();
    }
}

int main()
{
    f>>n>>m;
    citire();
    bordare();
    lee();
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(b[i][j]==v[i][j])
                if(v[i][j]<nrmin&&v[i][j]!=0)
                {
                    L=i;
                    C=j;
                    nrmin=v[i][j];
                }
    g<<nrmin<<" "<<L<<" "<<C;
    return 0;
}