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

using namespace std;

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

const int N=105;

int n,m,a[N][N],romeo[N][N],juliet[N][N],imeet,jmeet,time;

queue < pair < int, pair < int, int > > > que;

int di[10]={-1,-1,-1, 0,0, 1,1,1};
int dj[10]={-1, 0, 1,-1,1,-1,0,1};

void Read ()
{
    int i,j;
    char s[N];
    f>>n>>m;
    f.get();
    for(i=1;i<=n;i++)
    {
        f.getline(s,N);
        for(j=0;j<m;j++)
            switch(s[j])
            {
                case 'X': a[i][j+1]=-1;
                            break;
                case 'R': a[i][j+1]=1;
                          romeo[i][j+1]=1;
                          que.push(make_pair(1,make_pair(i,j+1)));
                            break;
                case 'J': a[i][j+1]=2;
                          que.push(make_pair(2,make_pair(i,j+1)));
                          juliet[i][j+1]=1;
                            break;
                case ' ':   break;
            }
    }
}

void out ()
{
    int i,j;
    for(i=0;i<=n+1;i++,cout<<'\n')
        for(j=0;j<=m+1;j++)
            cout<<setw(2)<<a[i][j]<<" ";
    cout<<'\n';
}

void border ()
{
    int i;
    for(i=0;i<=n+1;i++)
    {
        a[i][0]=-1;
        a[i][m+1]=-1;
    }
    for(i=0;i<=m+1;i++)
    {
        a[0][i]=-1;
        a[n+1][i]=-1;
    }
}

void lee ()
{
    int t,i,j,inew,jnew,person;
    while(!que.empty())
    {
        person=que.front().first;
        i=que.front().second.first;
        j=que.front().second.second;
        que.pop();
        for(t=0;t<8;t++)
        {
            inew=i+di[t];
            jnew=j+dj[t];
            if(!a[inew][jnew])
            {
                if(person==1 && !romeo[inew][jnew])
                {
                    romeo[inew][jnew]=romeo[i][j]+1;
                    que.push(make_pair(1,make_pair(inew,jnew)));
                }
                else
                    if(person==2 && !juliet[inew][jnew])
                    {
                        juliet[inew][jnew]=juliet[i][j]+1;
                        que.push(make_pair(2,make_pair(inew,jnew)));
                    }
                if(romeo[inew][jnew]==juliet[inew][jnew] && romeo[inew][jnew])
                {
                    imeet=inew;
                    jmeet=jnew;
                    time=romeo[inew][jnew];
                    return;
                }
            }
        }
    }
}

int main()
{
    Read();
    //out();
    border();
    lee();
    g<<time<<" "<<imeet<<" "<<jmeet<<'\n';
    return 0;
}