#include <fstream>
#include <string>
#include <queue>
using namespace std;
         ifstream in("rj.in");
         ofstream out("rj.out");
int A[105][105],N,M;
queue < pair<int, int> > Q ;
int di[8] = {0,0,1,1,1,-1,-1,-1};
int dj[8] = {1,-1,-1,0,1,-1,0,1};
string s;
pair < int,int > rasp;
void read()
{
    in>>N>>M;
    getline(in,s);
    for( int i=1; i<=N; i++)
    {
        getline(in,s);
        for(int j=0; j<M; j++)
    {
            if(s[j] == 'X' ) A[i][j+1]=-1;
            if(s[j] == 'J'|| s[j] == 'R' ) { Q.push( make_pair(i,j+1)); A[i][j+1]=1 ;}
    }

    }
}
bool OK(int i, int j )
{
   if( i<1 || j<1 || i>N || j>M ) return false ;
   if ( A[i][j] == -1 ) return false ;
     return true ;
}
void Lee()
{
    int i,j,i_next,j_next;
    while( !Q.empty() )
    {
        i = Q.front().first;
        j = Q.front().second;
        Q.pop();
    for( int dr=0; dr<8; dr++)
    {
        i_next=i+di[dr];
        j_next=j+dj[dr];
        if( OK(i_next, j_next ) && !A[i_next][j_next] )
        {
            A[i_next][j_next]=A[i][j]+1;
            Q.push(make_pair(i_next,j_next));
        } else  { rasp.first=i; rasp.second = j ;}
    }
    }
}
int main()
{
     read();
      Lee();
      int x =rasp.first, y=rasp.second;
      out<<A[x][y]<<' '<<x<<' '<<y;
    return 0;
}