#include <bits/stdc++.h>

using namespace std;

int n, m;
int a[107][107], rom[107][107], jul[107][107];
int lr, cr, lj, cj;

queue <pair<int, int> > q;

void Citire()
{
    ifstream fin ("rj.in");
    int i, j, k, x;
    char w[107];
    fin >> n >> m;
    i=j=0;
    while (fin.getline(w, 107))
    {
        x=strlen(w);
        for (k=0; k<x; k++)
        {
            if (w[k]=='X') a[i][j]=0;
            else if (w[k]==' ') a[i][j]=1;
                else if (w[k]=='R')
                {
                    a[i][j]=1;
                    lr=i;
                    cr=j;
                }
                    else if (w[k]=='J')
                    {
                        a[i][j]=1;
                        lj=i;
                        cj=j;
                    }
            j++;
        }
        j=1;
        i++;
    }
    fin.close();
}

void Bordare()
{
    int i, j;
    for (i=0; i<=n+1; i++)
        a[i][0]=a[i][n+1]=0;
    for (i=0; i<=m+1; i++)
        a[0][i]=a[m+1][i]=0;

    for (i=1; i<=n; i++)
        for (j=1; j<=m; j++)
            rom[i][j]=jul[i][j]=1000007;
}

void LeeRom()
{
    int i, j, x, y, k;
    int dx[10]={0, 0, -1, 1, -1, 1, -1, 1};
    int dy[10]={1, -1, 0, 0, 1, 1, -1, -1};
    q.push(make_pair(lr, cr));
    rom[lr][cr]=1;
    while (!q.empty())
    {
        i=q.front().first;
        j=q.front().second;
        q.pop();
        for (k=0; k<8; k++)
        {
            x=dx[k]+i;
            y=dy[k]+j;
            if (a[x][y]!=0 && rom[x][y]>rom[i][j]+1)
            {
                rom[x][y]=rom[i][j]+1;
                q.push(make_pair(x, y));
            }
        }
    }
}

void LeeJul()
{
    int i, j, x, y, k;
    int dx[10]={0, 0, -1, 1, -1, 1, -1, 1};
    int dy[10]={1, -1, 0, 0, 1, 1, -1, -1};
    q.push(make_pair(lj, cj));
    jul[lj][cj]=1;
    while (!q.empty())
    {
        i=q.front().first;
        j=q.front().second;
        q.pop();
        for (k=0; k<8; k++)
        {
            x=dx[k]+i;
            y=dy[k]+j;
            if (a[x][y]!=0 && jul[x][y]>jul[i][j]+1)
            {
                jul[x][y]=jul[i][j]+1;
                q.push(make_pair(x, y));
            }
        }
    }
}

void Solve()
{
    int i, j, x, y, minim=1000007;
    for (i=1; i<=n; i++)
        for (j=1; j<=m; j++)
            if (rom[i][j]==jul[i][j] && rom[i][j]<minim)
            {
                x=i;
                y=j;
                minim=rom[i][j];
            }
    ofstream fout ("rj.out");
    fout << minim << " "<< x << " " << y << "\n";
    fout.close();
}

int main()
{
    Citire();
    Bordare();
    LeeRom();
    LeeJul();
    Solve();

    /*for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
            cout << a[i][j] <<" ";
        cout << "\n";
    }*/
    return 0;
}