#include <bits/stdc++.h>
using namespace std;

ifstream fin("rj.in");
ofstream fout("rj.out");

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

int a[102][102];
int b[102][102];

void lee(int a[][102], int x, int y)
{
    queue <int> ql, qc;
    int l, c, i, lv, cv;
    //a[x][y] = 1;
    ql.push(x);
    qc.push(y);
    while (ql.empty() == 0)
    {
        l = ql.front();
        c = qc.front();
        ql.pop();
        qc.pop();
        for (i = 0; i<8; i++)
        {
            lv = l + dl[i];
            cv = c + dc[i];
            if (a[lv][cv] == 0)
            {
                a[lv][cv] = a[l][c] + 1;
                ql.push(lv);
                qc.push(cv);
            }
        }
    }

}

int main()
{
    int n, i, j, m, lr, cr, lj, cj;
    fin >> n >> m;
    char x;
    for (i = 1; i<=n; i++)
    {
        fin.get();
        for (j = 1; j<=m; j++)
        {
            fin.get(x);
            if (x == 'X')
            {
                a[i][j] = -1;
                b[i][j] = -1;
            }
            else if (x == 'J')
            {
                lj = i;
                cj = j;
                b[i][j] = 1;
            }
            else if (x == 'R')
            {
                a[i][j] = 1;
                lr = i;
                cr = j;
            }
            else ;
        }
    }
    for (i = 0; i<=m+1; i++)
        a[0][i] = a[n+1][i] = b[0][i] = b[n+1][i] = -1;
    for (i = 0; i<=n+1; i++)
        a[i][0] = a[i][m+1] = b[i][0] = b[i][m+1] = -1;
    //fout << lr << ' ' << cr << ' ' << lj << ' ' << cj<<'\n';
    lee(a, lr, cr);
    lee(b, lj, cj);
    int minx=0, miny=0, mint = 1000000;
    for (i = 1; i<=n; i++)
    {
        for (j = 1; j<=m; j++)
        {
        if (a[i][j] == b[i][j] && a[i][j] > 0)
        {
            if (a[i][j] < mint)
            {
                mint = a[i][j];
                minx = i;
                miny = j;
            }
        }
        }
    }
    fout << mint << ' ' << minx << ' ' << miny;
    return 0;
}