#include<fstream>
#include<iostream>
#include<queue>
using namespace std;
int n, m;
char h[101][101];
int hr[101][101], hj[101][101];
int di[] = { -1, 0, 1, 0, 1, 1, -1, -1 };
int dj[] = { 0, 1, 0, -1, 1, -1, 1, -1 };
int tmin = 10000000;
int iout, jout;
struct punct
{
	int i, j;
}rom,jul;
queue<punct> que;
ifstream f("rj.in");
ofstream g("rj.out");
void lee(punct start,int harta[][101])
{
	while (!que.empty())
		que.pop();

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
			harta[i][j] = -1;
	}

	que.push(start);
	harta[start.i][start.j] = 1;
	while (!que.empty())
	{
		punct aici = que.front();
		for (int i = 0; i < 8; i++)
		{
			int new_i = aici.i + di[i];
			int new_j = aici.j + dj[i];
			if (new_i >= 0 && new_j >= 0 && new_i < n && new_j < m && h[new_i][new_j] == ' ' && harta[new_i][new_j]==-1)
			{
				harta[new_i][new_j] = harta[aici.i][aici.j] + 1;
				punct b;
				b.i = new_i;
				b.j = new_j;
				que.push(b);
			}
		}
		que.pop();
	}
}
int main()
{
	
	f >> n >> m;
	f.get();
	char lin[101];
	for (int i = 0; i < n; i++)
	{
		
		f.getline(lin,101);
		for (int j = 0; j < m; j++)
		{
			h[i][j] = lin[j];
			if (lin[j] == 'R')
			{
				rom.i = i;
				rom.j = j;
				h[i][j] = ' ';
			}
			if (lin[j] == 'J')
			{
				jul.i = i;
				jul.j = j;
				h[i][j] = ' ';
			}
		}
	}
	lee(rom, hr);
	lee(jul, hj);
	for (int i = 0; i < n;i++)
	for (int j = 0; j < m;j++)
	{
		if (hr[i][j] == hj[i][j] && hr[i][j]>0 && hr[i][j] < tmin)
		{
			tmin = hr[i][j];
			iout = i;
			jout = j;
		}
	}
	g << tmin << " " << iout + 1 << " " << jout + 1;
	f.close();
	g.close();
	return 0;
}