#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
int n, m, rx, ry, jx, jy;
int dr[101][101], dj[101][101];
string d[101];
int dx[]={-1, -1, 0, 1, 1, 1, 0, -1};
int dy[]={0, 1, 1, 1, 0, -1, -1, -1};
queue<pair<int,int> > q;

bool verif(int X, int Y){
    if(X<1||X>n||Y<1||Y>m)return false;
    return true;
}

void lee(int x, int y, int a[101][101]){
    q.push(make_pair(x, y));
    a[x][y]=1;
    while(!q.empty()){
        x=q.front().first;
        y=q.front().second;
        q.pop();
        for(int i=0; i<8; i++){
            int X=x+dx[i];
            int Y=y+dy[i];
            if(verif(X, Y)&&d[X][Y-1]==' '&&!a[X][Y]){
                q.push(make_pair(X, Y));
                a[X][Y]=a[x][y]+1;
            }
        }
    }
}

int main(){
    ifstream in("rj.in");
    ofstream out("rj.out");
    in>>n>>m;
    string x;
    in.get();
    for(int i=1; i<=n; i++){
        getline(in, x);
        d[i]=x;
        for(int j=0; j<m; j++){
            if(d[i][j]=='R'){
                rx=i;
                ry=j+1;
            }else if(d[i][j]=='J'){
                jx=i;
                jy=j+1;
            }
        }
    }
    lee(rx, ry, dr);
    lee(jx, jy, dj);

    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(dr[i][j]==dj[i][j]&&dr[i][j]!=0){
                out<<dr[i][j]<<" "<<i<<" "<<j;
                break;
            }
        }
    }
    return 0;
}