#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
#define nmax 101

using namespace std;

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

short n,m,i,j,k,minimi=nmax,minimj=nmax,val;
short a[nmax][nmax];

string s;
queue <short> qi,qj;

void rj(){
    
    while (!qi.empty()){
        
        i=qi.front(), j=qj.front();
        
        qi.pop(), qj.pop();
        
        int k=a[i][j];
        
        if (a[i-1][j-1]==-1 || a[i-1][j-1]>k)
        {
            if (a[i-1][j-1]==k+1){
                if (i-1<=minimi){
                    minimi=i-1;
                    minimj=j-1;
                    val=k+1;
                }
            }
            
            a[i-1][j-1]=k+1, qi.push(i-1), qj.push(j-1);
        }
        
        if (a[i-1][j]==-1 || a[i-1][j]>k){
            
            if (a[i-1][j]==k+1){
                if (i-1<=minimi){
                    minimi=i-1;
                    minimj=j;
                    val=k+1;
                }
            }
            
            a[i-1][j]=k+1, qi.push(i-1), qj.push(j);
        }
        
        if (a[i-1][j+1]==-1 || a[i-1][j+1]>k){
            
            if (a[i-1][j+1]==k+1){
                if (i-1<=minimi){
                    minimi=i-1;
                    minimj=j+1;
                    val=k+1;
                }
            }
            
            a[i-1][j+1]=k+1, qi.push(i-1), qj.push(j+1);
        }
            
        if (a[i][j-1]==-1 || a[i][j-1]>k){
            
            if (a[i][j-1]==k+1){
                if (i<=minimi){
                    minimi=i;
                    minimj=j-1;
                    val=k+1;
                }
            }
            
            a[i][j-1]=k+1, qi.push(i), qj.push(j-1);
        }
            
        if (a[i][j+1]==-1 || a[i][j+1]>k){
            
            if (a[i][j+1]==k+1){
                if (i<=minimi){
                    minimi=i;
                    minimj=j+1;
                    val=k+1;
                }
            }
            
            a[i][j+1]=k+1, qi.push(i), qj.push(j+1);
        }
        
        if (a[i+1][j-1]==-1 || a[i+1][j-1]>k){
            
            if (a[i+1][j-1]==k+1){
                if (i<=minimi){
                    minimi=i+1;
                    minimj=j-1;
                    val=k+1;
                }
            }
            
            a[i+1][j-1]=k+1, qi.push(i+1), qj.push(j-1);
        }
    
        if (a[i+1][j]==-1 || a[i+1][j]>k){
            
            if (a[i+1][j]==k+1){
                if (i<=minimi){
                    minimi=i+1;
                    minimj=j;
                    val=k+1;
                }
            }
            
            a[i+1][j]=k+1, qi.push(i+1), qj.push(j);
        }
        
        if (a[i+1][j+1]==-1 || a[i+1][j+1]>k){
            
            if (a[i+1][j+1]==k+1){
                if (i<=minimi){
                    minimi=i+1;
                    minimj=j+1;
                    val=k+1;
                }
            }
            
            a[i+1][j+1]=k+1, qi.push(i+1), qj.push(j+1);
        }
    }
    
}

void read(){

    in >> n >> m;
    
    in.get();
    
    for (i=1; i<=n; i++){
        
        getline(in, s);
        
        k=0;
        
        for (j=0; j<m; j++){
            
            k++;
            
            if (s[j]=='R') a[i][k]=1, qi.push(i), qj.push(k);
            else if (s[j]=='J') a[i][k]=1, qi.push(i), qj.push(k);
            
            if (isspace(s[j])) a[i][k]=-1;
            
            if (s[j]=='X') a[i][k]=-2;
            
        }
        
    }
    
}

int main(){
    
    read();
    
    rj();
    
    out<<val<<" "<<minimi<<" "<<minimj<<"\n";
    
    return 0;
}