#include<bits/stdc++.h>
using namespace std;

const int MAXN = 105;
int ans[MAXN][MAXN];
map<pair<int, int>, int> mapa;
vector<int> v[MAXN][MAXN];
vector<int> dx = {-1, 0, 1, 0};
vector<int> dy = {0, 1, 0, -1};
int N, M;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> N >> M;

    vector<string> G(M); for (auto& s : G) cin >> s;

    int x = 0, y = 0, cur = 1;
    for (int i = 1; i < MAXN; ++i) {
        for (int dir : {0, 1, 2, 3}) {
            int offset = 0;
            if (dir < 2) offset++;
            for (int g = 2*i - offset; g > 0; --g) {
                x += dx[dir];
                y += dy[dir];
                mapa[{x, y}] = cur++;
            }
        }
    }

    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            if (G[i][j] != 'X') continue;

            for (int ii = 0; ii < M; ++ii) {
                for (int jj = 0; jj < N; ++jj) {
                    int h = mapa[{i - ii, j - jj}];
                    v[ii][jj].push_back(h);
                }
            }
        }
    }

    vector<pair<int, int>> idx;
    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            sort(v[i][j].begin(), v[i][j].end());
            idx.push_back({i, j});
        }
    }

    sort(idx.begin(), idx.end(), [&](const auto& l, const auto& r) {
        return v[l.first][l.second] < v[r.first][r.second];
    });

    // cout << "WOW" << endl;
    for (int g = 1; g < N*M; ++g) {
        int xx = idx[g].first;
        int yy = idx[g].second;
        x = idx[g-1].first;
        y = idx[g-1].second;

        bool found = false;
        int l = 0;
        while (true) {
            if (found) break;
            auto a = v[x][y][l];
            auto b = v[xx][yy][l++];
            // cout << a << ' ' << b << endl;
            if (a != b) {
                ans[x][y] = max(ans[x][y], min(a, b));
                ans[xx][yy] = max(ans[xx][yy], min(a, b));
                found = true;
            }
        }
    }

    int sum = 0;
    int max_val = 0;
    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            sum += ans[i][j];
            max_val = max(max_val, ans[i][j]);
        }
    }

    cout << fixed << setprecision(20);
    cout << 1.0 * sum / N / M << '\n';
    cout << max_val << '\n';

    vector<pair<int, int>> pnts;
    for (int i = M-1; i >= 0; --i) {
        for (int j = 0; j < N; ++j) {
            if (ans[i][j] != max_val) continue;
            pnts.push_back({j, M-1-i});
        }
    }

    int s = 0;
    for (auto [a, b] : pnts) {
        if (s != 0) cout << ' ';
        cout << "(" << a+1 << ',' << b+1 << ")";
        s += 1;
    }
}