#include <bits/stdc++.h>
using namespace std;
struct Walk { vector<int> dis; int x, y; Walk(int s) { dis.reserve(s); }; };
int operator < (const Walk &u, const Walk &v) { return u.dis < v.dis; };
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m; cin >> n >> m; vector<string> mp(m);
    for(int i = 0; i < m; ++i) cin >> mp[i];
    vector<pair<int, int>> q;
    for(int i = 0; i < m; ++i)
        for(int j = 0; j < n; ++j)
            if(mp[i][j] == 'X') q.emplace_back(i, j);
    vector<Walk> walk(n * m, Walk(q.size()));
    const int s = max(n, m), dif = 2 * s + 1;
    vector<vector<int>> dis(dif, vector<int>(dif));
    const auto &value = [&](int x, int y) { return \
        0 <= x && x < m && 0 <= y && y < n ? mp[x][y] : '.'; };
    const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
    int x = s, y = s, d = 0, len = 1, nw = 0;
    for(int k = 0; k < dif * dif; ++k) {
        dis[x][y] = k, x += dx[d], y += dy[d];
        if(++nw == len) nw = 0, len += (d & 1), d = (d + 1) & 3;
    }
    for(int i = 0, id = 0; i < m; ++i)
        for(int j = 0; j < n; ++j, ++id) {
            Walk &wk = walk[id]; wk.x = i, wk.y = j;
            for(const auto [x, y] : q)
                wk.dis.push_back(dis[x - i + s][y - j + s]);
            sort(wk.dis.begin(), wk.dis.end());
        }
    sort(walk.begin(), walk.end());
    vector<int> lcp(n * m);
    for(int i = 1; i < n * m; ++i) {
        const Walk &w0 = walk[i - 1], &w1 = walk[i];
        for(int j = 0;; ++j) if(w0.dis[j] != w1.dis[j])
            { lcp[i] = min(w0.dis[j], w1.dis[j]); break; }
    }
    for(int i = 1; i < n * m; ++i)
        lcp[i - 1] = max(lcp[i - 1], lcp[i]);
    int ret = 0, mx = *max_element(lcp.begin(), lcp.end());
    for(int i = 0; i < n * m; ++i) ret += lcp[i];
    printf("%.9lf\n%d\n", 1.0 * ret / (n * m), mx);
    vector<pair<int, int>> lst;
    for(int i = 0; i < n * m; ++i)
        if(lcp[i] == mx) lst.emplace_back(m - walk[i].x, walk[i].y);
    sort(lst.begin(), lst.end());
    for(const auto [x, y] : lst) printf("(%d,%d) ", y + 1, x);
}