#include <fstream>
#include <iomanip>
#define INF 0x3f3f3f3f
#define iv i + di[w]
#define jv j + dj[w]
using namespace std;

ifstream is("rj.in");
ofstream os("rj.out");

int n, m;
int xj, yj, xr, yr;
int d[105][105];
char q[105][105];
const int di[] = { 1, 1, 1, 0, 0, -1, -1, -1};
const int dj[] = { -1, 0, 1, 1, -1, -1, 0, 1 };
int dmin;

void FILL(int i, int j, int k);
bool OK(int i, int j);

int main()
{
    is >> n >> m;
    is.get();
    for ( int i = 1; i <= n; ++i )
    {
        for ( int j = 1; j <= m; ++j )
        {
            q[i][j] = is.get();
            if ( q[i][j] == '\n' )
                q[i][j] = ' ';
            d[i][j] = INF;
            if ( q[i][j] == 'R' )
            {
                xr = i;
                yr = j;
                d[i][j] = 1;
                continue;
            }
            if ( q[i][j] == 'J' )
            {
                xj = i;
                yj = j;
                //d[i][j] = -1;
                continue;
            }
            if ( q[i][j] == 'X' )
                d[i][j] = 0;
        }
        if ( q[i][m] != ' ' )
            is.get();
    }
    FILL(xr, yr, 1);
    /*for ( int i = 1; i <= n; ++i )
    {
        for ( int j = 1; j <= m; ++j )
            //os << setw(3) << d[i][j];
            os << q[i][j];
        os << "\n";
    }*/
    dmin = ( d[xj][yj] + 2 ) / 2;
    os << dmin << " ";
    while ( d[xj][yj] != dmin )
    {
        for ( int i = 0; i < 8; ++i )
        {
            if ( d[xj + di[i]][yj + dj[i]] == d[xj][yj] - 1 )
            {
                xj += di[i];
                yj += dj[i];
                i = 8;
            }
        }
    }
    os << xj << " " << yj;
    is.close();
    os.close();
    return 0;
}

void FILL(int i, int j, int k)
{
    d[i][j] = k;
    for ( int w = 0; w < 8; ++w )
    {
        if ( !OK(iv, jv) )
            continue;
        if ( iv != i || jv != j )
        {
            if ( !d[i][jv] && !d[iv][j] )
                continue;
        }
        if ( d[iv][jv] > d[i][j] + 1 )
            FILL(iv, jv, k + 1);
    }
}

bool OK(int i, int j)
{
    if ( !i || !j || i > n || j > m )
        return false;
    if ( !d[i][j] )
        return false;
    return true;
}