#include <iostream>
#include <fstream>
#include <queue>
#include <cstring>

using namespace std;

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

const int NMAX=100;
int r[NMAX+2][NMAX+2],juli[NMAX+2][NMAX+2],n,m;

struct pozitie
{
    int x,y;
};

pozitie romeo, julieta;

queue<pozitie> q;

short d[8][2] = {{0, -1}, {-1, 0}, {0, 1}, {1, 0},{1, 1},{1, -1},{-1, 1},{-1, -1}};

void lee1()
{
    int k;
    q.push(romeo);
    pozitie crt,vec;
    while(!q.empty())
    {
        crt=q.front();
        q.pop();
        for(k=0;k<=7;k++)
        {
            vec.x=crt.x+d[k][0];
            vec.y=crt.y+d[k][1];
            if(r[vec.x][vec.y]==0)
            {
                r[vec.x][vec.y]=r[crt.x][crt.y]+1;
                q.push(vec);
            }
        }
    }
}

void lee2()
{
    int k;
    q.push(julieta);
    pozitie crt,vec;
    while(!q.empty())
    {
        crt=q.front();
        q.pop();
        for(k=0;k<=7;k++)
        {
            vec.x=crt.x+d[k][0];
            vec.y=crt.y+d[k][1];
            if(juli[vec.x][vec.y]==0)
            {
                juli[vec.x][vec.y]=juli[crt.x][crt.y]+1;
                q.push(vec);
            }
        }
    }
}

void bordare()
{
    int i;
    for(i=0;i<=n+1;i++)
    {
        juli[i][0]=juli[i][m+1]=r[i][0]=r[i][m+1]=-1;
    }
    for(i=1;i<=m;i++)
    {
        juli[0][i]=juli[n+1][i]=r[0][i]=r[n+1][i]=-1;
    }
}

int main()
{
    char x;
    int i,j,mini=1000,pcti,pctj;
    f>>n>>m;
    f.get(x);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            f.get(x);
            if(x=='X') juli[i][j]=r[i][j]=-1;
            else if (x=='R')
            {
                romeo.x=i;
                romeo.y=j;
                r[i][j]=1;
            }else if (x=='J')
            {
                julieta.x=i;
                julieta.y=j;
                juli[i][j]=1;
            }
        }
        f.get(x);
    }

    bordare();
    lee1();
    q.push(julieta);
    lee2();

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(r[i][j]>0 && r[i][j]==juli[i][j])
            {
                if(mini>r[i][j])
                {
                    mini=r[i][j];
                    pcti=i;
                    pctj=j;
                }
            }
        }
    }

    g<<mini<<' '<<pcti<<' '<<pctj;


    f.close();
    g.close();
    return 0;
}