#include <bits/stdc++.h> 

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

map<PII, int> mp;

void precalc()
{
	mp[{0, 0}] = 0;
	int x = 0, y = 0;
	int id = 1;
	FOR(i, 0, 200)
	{
		FOR(j, 0, 2 * i + 1)
		{
			y++;
			mp[{x, y}] = id++;
		}
		FOR(j, 0, 2 * i + 1)
		{
			x++;
			mp[{x, y}] = id++;
		}
		FOR(j, 0, 2 * i + 2)
		{
			y--;
			mp[{x, y}] = id++;
		}
		FOR(j, 0, 2 * i + 2)
		{
			x--;
			mp[{x, y}] = id++;
		}
	}
}

int f(const VI& a, const VI& b)
{
	assert(SZ(a) == SZ(b));
	int ptr = 0;
	while (ptr < SZ(a) && a[ptr] == b[ptr])
		ptr++;
	assert(ptr < SZ(a) && a[ptr] < b[ptr]);
	return a[ptr];
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int n, m;
	cin >> m >> n;
	vector<string> s(n);
	for (string& si : s)
		cin >> si;
	reverse(ALL(s));
	precalc();
	FOR(i, -100, 101)
		FOR(j, -100, 101)
			assert(mp.count({i, j}));
	cerr << (db)clock() / CLOCKS_PER_SEC << endl;
	vector<PII> crosses;
	FOR(i, 0, n)
		FOR(j, 0, m)
			if (s[i][j] == 'X')
				crosses.PB({i, j});
	vector<tuple<VI, int, int>> vec;
	vec.reserve(n * m);
	VI cur;
	FOR(i, 0, n)
	{
		FOR(j, 0, m)
		{
			cur.clear();
			for (auto [ycr, xcr] : crosses)
			{
				cur.PB(mp[{xcr - j, ycr - i}]);
			}
			sort(ALL(cur));
			vec.PB({cur, i, j});
		}
	}
	sort(ALL(vec));
	LL sum = 0, mx = 0;
	vector<PII> vecMx;
	assert(SZ(vec) == n * m);
	FOR(i, 0, SZ(vec))
	{
		const auto& [curVec, y, x] = vec[i];
		int difLeft = i == 0 ? 0 : f(get<0>(vec[i - 1]), curVec);
		int difRight = i + 1 == SZ(vec) ? 0 : f(curVec, get<0>(vec[i + 1]));
		int steps = max(difLeft, difRight);
		sum += steps;
		if (steps > mx)
		{
			mx = steps;
			vecMx.clear();
		}
		if (steps == mx)
		{
			vecMx.PB({y, x});
		}
	}
	sort(ALL(vecMx));
	cout << (db)sum / (n * m) << "\n";
	cout << mx << "\n";
	FOR(i, 0, SZ(vecMx))
	{
		auto [y, x] = vecMx[i];
		if (i)
			cout << " ";
		cout << "(" << x + 1 << "," << y + 1 << ")";
	}
	cout << "\n";
	return 0;
}