#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");

const int nmax=105;
const int mmax=105;

int dx[8]={-1,-1,1,1,-1,0,1,0};
int dy[8]={-1,1,1,-1,0,1,0,-1};

int n,m,a[nmax][mmax],mn[nmax][mmax];
int ir,jr,ij,jj;
struct cell
{
    int x,y;
};

void read_data()
{
    char c,b[mmax];

    fin>>n>>m;
    fin.get(c);

    for(int i=1;i<=n;i++)
    {
        fin.getline(b,m+2);
        for(int j=0;j<m;j++)
            if(b[j]=='R')
            {
                a[i][j+1]=-2;
                ir=i,jr=j+1;
            }
            else if(b[j]=='J')
            {
                a[i][j+1]=-2;
                ij=i,jj=j+1;
            }
            else if(b[j]=='X')
                a[i][j+1]=-1;
    }
}

bool okei(int lin,int col)
{
    if(lin>=1 && lin<=n && col>=1 && col<=m)
        return true;
    return false;
}

void bfs_alg()
{
    deque <cell> d;
    d.push_back({ir,jr});
    d.push_back({ij,jj});
    bool done=false;

    while(!d.empty() && !done)
    {
        int lin=d.front().x;
        int col=d.front().y;
        d.pop_front();

        for(int k=0;k<8 && !done;k++)
        {
            int ll=lin+dx[k];
            int cc=col+dy[k];

            if(okei(ll,cc) && a[ll][cc]==0)
                if(mn[ll][cc]==0)
                {
                    mn[ll][cc]=mn[lin][col]+1;
                    d.push_back({ll,cc});
                }
                else if(mn[ll][cc]==mn[lin][col]+1)
                {
                    fout<<mn[ll][cc]+1<<" "<<ll<<" "<<cc<<"\n";
                    done=true;
                }
        }
    }
}

void display()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            fout<<mn[i][j]<<" ";
        fout<<"\n";
    }
}

int main()
{
    read_data();
    bfs_alg();
    //display();


    return 0;
}