#include <iostream>
#include <fstream>
#include <cctype>
#include <queue>
#include <string>

using namespace std;

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

string s;

short n,m,a[105][105];

short dl[8]={-1,1,0,0,1,1,-1,-1};
short dc[8]={0,0,-1,1,1,-1,1,-1};

struct Pozitie
{
    short lin,col;
};

Pozitie p1,p2,v,p;

queue <Pozitie> C;

int main()
{
    f>>n>>m;
    f.get();
    for(int i=1;i<=n;++i)
    {
        getline(f,s);
        for(int j=0;j<m;++j)
        {
            if(isspace(s[j])) a[i][j+1]=0;
            else
            {
                if(s[j]=='X')
                    a[i][j+1]=-1;
                else
                {
                    if(s[j]=='R')
                    {
                        p1.lin=i;
                        p1.col=j+1;
                        C.push(p1);
                        a[p1.lin][p1.col]=1;
                    }
                    else
                    {
                        if(s[j]=='J')
                        {
                            p2.lin=i;
                            p2.col=j+1;
                            C.push(p2);
                            a[p2.lin][p2.col]=1;
                        }
                    }
                }
            }
        }
    }
    /*for(short i=1;i<=m;++i)
    {
        for(short j=1;j<=m;++j)
            cout<<a[i][j]<<' ';
        cout<<endl;
    }*/
    for(int i=0;i<=m+1;++i)
        a[0][i]=a[n+1][i]=-2;
    for(int i=0;i<=n+1;++i)
        a[i][0]=a[i][m+1]=-2;
    while(!C.empty())
    {
        p=C.front();
        C.pop();
        for(int k=0;k<8;++k)
        {
            v.lin=p.lin+dl[k];
            v.col=p.col+dc[k];
            if(a[v.lin][v.col]>a[p.lin][p.col])
            {
                g<<a[v.lin][v.col]<<' ';
                g<<v.lin<<' '<<v.col;
                break;
            }
            if(a[v.lin][v.col]==0)
            {
                a[v.lin][v.col]=a[p.lin][p.col]+1;
                C.push(v);
            }
        }
    }
    return 0;
}