#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
int n,m,dx[8]={-1,-1,-1,0,1,1,1,0},dy[8]={-1,0,1,1,1,0,-1,-1},x1,y1,x,y,ind;
char c[110][110], ch;
bool mark1[110][110],mark2[110][110];
int cont1[110][110],cont2[110][110];
queue <pair<int,int> > q;
queue <char> s;
pair<int, pair<int ,int > > a[1005];
bool verif(int x,int y)
{
    if(x>0 && y>0 && x<=n && y<=m)return 1;
    return 0;
}
int sol1=100000,sol2=100000,sol3=100000;
int main()
{
    in>>n>>m;
    in.getline(c[0],100);
    for(int i=1;i<=n;i++)
    {
        in.getline(c[i]+1,110);
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(c[i][j]=='R'|| c[i][j]=='J')
            {
                q.push(make_pair(i,j));
                if(c[i][j]=='R')s.push('R'),mark1[i][j]=1;
                else s.push('J'),mark2[i][j]=1;
            }
        }
    }
    for(int i=1;i<=105;i++)
    {
        for(int j=1;j<=105;j++)
        {
            if(!mark1[i][j])
            cont1[i][j]=100000;
            if(!mark2[i][j])
            cont2[i][j]=100000;
        }
    }
    while(!q.empty())
    {
        x=q.front().first;
        y=q.front().second;
        ch=s.front();
        for(int i=0;i<8;i++)
        {
            x1=x+dx[i];
            y1=y+dy[i];
            if(verif(x1,y1) && c[x1][y1]!='X')
            {
                if(ch=='R')
                {
                    if(mark1[x1][y1]==0 || cont1[x1][y1]>cont1[x][y]+1)
                    {
                        mark1[x1][y1]=1;
                        if(cont2[x1][y1]==cont1[x][y]+1)
                        {
                            a[++ind].first=cont2[x1][y1];
                            a[ind].second.first=x1;
                            a[ind].second.second=y1;
                        }
                        else
                        {
                            cont1[x1][y1]=cont1[x][y]+1;
                            q.push(make_pair(x1,y1));
                            s.push('R');
                        }
                    }
                }
                else if(ch=='J')
                {
                    if(mark2[x1][y1]==0 || cont2[x1][y1]>cont2[x][y]+1)
                    {
                        mark2[x1][y1]=1;
                        if(cont1[x1][y1]==cont2[x][y]+1)
                        {
                            a[++ind].first=cont1[x1][y1];
                            a[ind].second.first=x1;
                            a[ind].second.second=y1;
                        }
                        else
                        {
                            cont2[x1][y1]=cont2[x][y]+1;
                            q.push(make_pair(x1,y1));
                            s.push('J');
                        }
                    }
                }
            }
        }
        q.pop();s.pop();
    }
    for(int i=1;i<=ind;i++)
    {
        if(sol1>a[i].first)
        {
            sol1=a[i].first;
            sol2=a[i].second.first;
            sol3=a[i].second.second;
        }
        else if(sol1==a[i].first)
        {
            if(a[i].second.first<sol2)
            {
                sol1=a[i].first;
                sol2=a[i].second.first;
                sol3=a[i].second.second;
            }
            else if(a[i].second.first==sol2)
            {
                if(a[i].second.second<sol3)
                {
                    sol1=a[i].first;
                    sol2=a[i].second.first;
                    sol3=a[i].second.second;
                }
            }
        }
    }
    out<<sol1+1<<' '<<sol2<<' '<<sol3;
    return 0;
}