#include <bits/stdc++.h>

using namespace std;

int n, m;
int rom[107][107], jul[107][107];
char a[107][107];
int lr, cr, lj, cj;
queue<pair<int, int> >q;

void Citire()
{
    ifstream fin ("rj.in");
    int i, j;
    fin >> n >> m;
    fin.get();
    for (i = 1; i <= n; i++)
    {
        fin.getline(a[i]+1, 101);
        for (j=1; j <= m; j++)
        {
            if (a[i][j]=='R')
                {
                    lr=i;
                    cr=j;
                }
            else if (a[i][j]=='J')
                    {
                        lj=i;
                        cj=j;
                    }
        }
    }
    fin.close();
}

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

    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[]={0, 0, -1, 1, -1, 1, -1, 1};
    int dy[]={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]!='X' && 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]!='X' && 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, meetx, meety, 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)
            {
                meetx=i;
                meety=j;
                minim=rom[i][j];
            }
    ofstream fout ("rj.out");
    fout << minim << " "<< meetx << " " << meety << "\n";
    fout.close();
}

int main()
{
    Citire();
    Bordare();
    LeeRom();
    LeeJul();
    Solve();
    return 0;
}