#include <bits/stdc++.h>
#define NM 105
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");

int n,m,xR,yR,xJ,yJ,a[NM][NM],b[NM][NM];
int dl[]={-1,1,0,0,1,1,-1,-1};
int dc[]={0,0,-1,1,-1,1,1,-1};
queue <pair<int,int>> coada;

void Read();
void Solve();
void Lee(int,int,int[NM][NM]);
bool Inside(int,int);

int main()
{   Read();
    Solve();
    return 0;
}

void Read()
{   f>>n>>m;
    for(int i=1; i<=n; i++)
    {   char s[NM*NM];
        f.get();
        f.get(s,NM*NM);
        for(int j=0; j<m; j++)
        {   char c=s[j];
            if(c=='R')
            {   xR=i;
                yR=j+1;
                a[i][j+1]=1;
            }
            if(c=='J')
            {   xJ=i;
                yJ=j+1;
                b[i][j+1]=1;
            }
            if(c=='X') a[i][j+1]=b[i][j+1]=-1;
        }
    }
}

void Solve()
{   Lee(xR,yR,a);
    Lee(xJ,yJ,b);
    int tMin=1<<30,x,y;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            if(a[i][j]==b[i][j] && a[i][j]!=-1 && a[i][j] && a[i][j]<tMin)
            {   tMin=a[i][j];
                x=i;
                y=j;
            }
    g<<tMin<<' '<<x<<' '<<y;
}

void Lee(int x,int y,int c[NM][NM])
{   coada.push({x,y});
    while(!coada.empty())
    {   int i=coada.front().first;
        int j=coada.front().second;
        coada.pop();
        for(int k=0; k<8; k++)
        {   int ni=i+dl[k];
            int nj=j+dc[k];
            if(Inside(ni,nj) && !c[ni][nj])
            {   c[ni][nj]=c[i][j]+1;
                coada.push({ni,nj});
            }
        }
    }
}

bool Inside(int i,int j) {return (i>=1 && i<=n && j>=1 && j<=m);}