#include <iostream>
#include <fstream>
#include <queue>
#include <cstdio>
using namespace std;

FILE *f=fopen("rj.in","r");
ofstream g("rj.out");

queue <pair<int,int>>Q;
int n,m,a[110][110],b[110][110];
char c;
int di[9]={-1,-1,0,1,1,1,0,-1};
int dj[9]={0,1,1,1,0,-1,-1,-1};
int pi1,pi2,pj1,pj2,si1,si2,sj1,sj2;
int tmin=1000000000;

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

void cit()
{
    fscanf(f,"%d %d\n",&n,&m);

    bordare();

    for(int i=1;i<=n;i++)
    {
        char c[110];

        fgets(c+1,110,f);

        for(int j=1;j<=m;j++)
        {
            if(c[j]=='\n')
                c[j]=' ';

            if(c[j]=='X')
            {
                a[i][j]=-1;
                b[i][j]=-1;
            }
            else if(c[j]=='R')
            {
                a[i][j]=1;
                pi1=i;
                pj1=j;
                si2=i;
                sj2=j;
            }
            else if(c[j]=='J')
            {
                b[i][j]=1;
                pi2=i;
                pj2=j;
                si1=i;
                sj1=j;
            }
        }
    }
}

void lee(int pi, int pj, int si, int sj, int a[][110])
{
    Q.push({pi,pj});

    while(!Q.empty())
    {
        int i=Q.front().first,j=Q.front().second;
        Q.pop();

        for(int v=0;v<8;v++)
        {
            int iv=i+di[v];
            int jv=j+dj[v];

            if(a[iv][jv]==0)
            {
                a[iv][jv]=a[i][j]+1;
                Q.push({iv,jv});
            }
        }
    }
}

int main()
{
    cit();

    lee(pi1,pj1,si1,sj1,a);
    lee(pi2,pj2,si2,sj2,b);

    int i1,j1;

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(a[i][j]==b[i][j] && a[i][j]>0 && a[i][j]<tmin)
            {
                tmin=a[i][j];
                i1=i;
                j1=j;
            }
        }
    }

    g<<tmin<<' '<<i1<<' '<<j1;

    return 0;
}