#include <iostream>
#include <fstream>
#include <queue>
#include <utility>
#include <climits>

using namespace std;

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

const int N=100;

int dx[]={-1,-1,0,1,1,1,0,-1};
int dy[]={0,1,1,1,0,-1,-1,-1};

char a[N+2][N+2];

int rl[N+2][N+2],jl[N+2][N+2];

int n,m,ans=INT_MAX,l,c;

pair <int,int> rStart, jStart;

void read()
{
    in>>n>>m;
    in.get();
    char s[N+2];
    for(int i=0; i<n; ++i)
    {
        in.getline(s,sizeof(s));
        for(int j=0; j<m; ++j)
        {
            a[i][j]=s[j];
            if(a[i][j]=='R')
            {
                rStart=make_pair(i,j);
            }
            else if(a[i][j]=='J')
            {
                jStart=make_pair(i,j);
            }
            rl[i][j]=jl[i][j]=-1;
        }

    }
}

bool check(int i,int j)
{
    return (i>=0 && i<n && j>=0 && j<m);
}

void lee(int t[N+2][N+2], pair <int,int> start)
{
    queue <pair<int,int>> q;
    pair <int, int> cur;
    int nx,ny;
    q.push(start);
    t[start.first][start.second]=1;
    while(!q.empty())
    {
        cur=q.front();
        q.pop();
        for(int i=0; i<8; ++i)
        {
            nx=cur.first+dx[i];
            ny=cur.second+dy[i];
            if(check(nx,ny))
            {
                if(a[nx][ny]!='X' && t[nx][ny]==-1)
                {
                    t[nx][ny]=t[cur.first][cur.second]+1;
                    q.push(make_pair(nx,ny));
                }
            }
        }
    }
}

void solve()
{
    for(int i=0; i<n; ++i)
    {
        for(int j=0; j<m; ++j)
        {
            if(rl[i][j]==jl[i][j] && rl[i][j]!=-1)
            {
                if(rl[i][j]<ans)
                {
                    ans=rl[i][j];
                    l=i;
                    c=j;
                }
            }
        }
    }
    out<<ans<<" "<<l+1<<" "<<c+1;
}

int main()
{
    read();
    lee(rl,rStart);
    lee(jl,jStart);
    solve();
    return 0;
}