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

using i64 = long long;
using u64 = unsigned long long;

struct debug {
#define contPrint { *this << "["; \
        int f = 0; for(auto it : x) { *this << (f?", ":""); *this << it; f = 1;} \
        *this << "]"; return *this;}
 
    ~debug(){cerr << endl;}
    template<class c> debug& operator<<(c x) {cerr << x; return *this;}
    template<class c, class d>
    debug& operator<<(pair<c, d> x) {*this << "(" << x.first << ", " << x.second << ")"; 
        return *this;}
    template<class c> debug& operator<<(vector<c> x) contPrint;
#undef contPrint
};

#define dbg(x) "[" << #x << ": " << x << "]  "
#define Wa() cerr << "[LINE: " << __LINE__ << "] -> "; debug() << 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);

vector<tuple<vector<int>, int, int>> cells;
int tot = 0;
vector<pair<int, int>> ans;
int mx = 0;

int DY;

void f(int l, int r, int idx, int pmx)
{
    if(r == l) {
        int cur = get<0>(cells[l])[idx-1];
        int x = get<1>(cells[l]);
        int y = get<2>(cells[l]);

        if(cur > pmx) cur = pmx;

        if(cur > mx) {
            ans.clear();
            ans.push_back({x + 1, DY - y});
            mx = cur;
        } else if(cur == mx) {
            ans.push_back({x + 1, DY - y});
        }

        tot += cur;

        // Wa() dbg(l) dbg(r) dbg(x) dbg(y) dbg(cur) dbg(pmx) dbg(get<0>(cells[l]));

        return;
    }

    for(int i = l; i <= r; ) {
        int nl = i;
        while(i <= r && get<0>(cells[i])[idx] == get<0>(cells[nl])[idx]) {
            i++;
        }
        int npmx = get<0>(cells[r])[idx];

        if(i > r) {
            npmx = get<0>(cells[max(l, r - 1)])[idx];
        }
        // Wa() dbg(npmx);

        f(nl, i - 1, idx + 1, npmx);
    }
}

int main() 
{
    int dx, dy;
    scanf("%d %d", &dx, &dy);
    DY = dy;

    vector<pair<int, int>> pos;
    char grid[dy][dx];
    for(int i = 0; i < dy; i++) {
        for(int j = 0; j < dx; j++) {
            scanf(" %c", &grid[i][j]);
            if(grid[i][j] == 'X') {
                pos.push_back({j, i});
            }
        }
    }

    vector<i64> sum(105);
    sum[0] = 1;
    for(int i = 1; i < 105; i++) {
        sum[i] = sum[i-1] + 2 * i * 4;
    }

    auto inside = [] (int x, int y, int lx, int ly, int rx, int ry) {
        return x >= lx && x <= rx && y >= ly && y <= ry;
    };

    vector<int> seq[dx][dy];
    for(int y = 0; y < dy; y++) {
        for(int x = 0; x < dx; x++) {
            for(auto [px, py] : pos) {
                int m = max(abs(px - x), abs(py - y));
                if(m == 0) seq[x][y].push_back(0);
                else {
                    int cell = sum[m-1];
                    if(inside(px, py, x - m + 1, y - m, x + m, y - m)) {
                        cell += (px - (x - m + 1));

                    } else if(inside(px, py, x + m, y - m + 1, x + m, y + m)) {
                        cell += 2 * m + py - (y - m + 1);

                    } else if(inside(px, py, x - m, y + m, x + m - 1, y + m)) {
                        cell += 4 * m + abs(px - (x + m - 1));

                    } else if(inside(px, py, x - m, y - m, x - m, y + m - 1)) {
                        cell += 6 * m + abs(py - (y + m - 1));

                    } else {
                        assert(false);
                    }
                    seq[x][y].push_back(cell);
                }
            }
            sort(seq[x][y].begin(), seq[x][y].end());
            cells.push_back({seq[x][y], x, y});

            // printf("%d %d: ", x, y);
            // for(int i : seq[x][y]) {
            //     printf("%d ", i);
            // }
            // puts("");
        }
    }
    sort(cells.begin(), cells.end(), [&] (auto& a, auto& b) {
            for(int i = 0; i < (int)pos.size(); i++) {
                if(get<0>(a)[i] < get<0>(b)[i]) {
                    return true;
                }
                if(get<0>(a)[i] > get<0>(b)[i]) {
                    return false;
                }
            }
            return true;
        });

    // for(auto it : cells) {
    //     Wa() dbg(get<0>(it));
    // }

    f(0, (int)cells.size() - 1, 0, 0);

    sort(ans.begin(), ans.end(), [] (auto a, auto b) {
                return (a.second < b.second) || (a.second == b.second && a.first < b.first);
            });

    printf("%.3lf\n", 1.0 * tot / (dx * dy));
    printf("%d\n", mx);
    for(int i = 0; i < (int)ans.size(); i++) {
        if(i) printf(" ");
        printf("(%d,%d)", ans[i].first, ans[i].second);
    }
    puts("");
}