#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
int n, m;
ll total = 0, ans[205][205];
char arr[205][205];
vector<pii> X;
ll count(int x, int y, int nx, int ny){
    ll d = max(abs(nx - x), abs(ny - y));
    ll dis = max(2 * d - 1, 0LL) * max(2 * d - 1, 0LL);
    if (x == nx && y == ny)
        return 0;
    if (x == nx - d && y == ny - d)
        return dis + 8 * d - 1;
    if (x == nx - d)
        return dis + y - (ny - d) - 1;
    if (y == ny + d)
        return dis + 2 * d + x - (nx - d) - 1;
    if (x == nx + d)
        return dis + 4 * d + (ny + d) - y - 1;
    return dis + 6 * d + (nx + d) - x - 1;
}
ll solve(vector<ll> v1, vector<ll> v2){
    for (int i = 0; i < v1.size(); i++){
        if (v1[i] != v2[i])
            return min(v1[i], v2[i]);
    }
    return -1;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    swap(n, m);
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            cin >> arr[i][j];
            if (arr[i][j] == 'X')
                X.emplace_back(i, j);
        }
    }
    vector<pair<vector<ll>, pii> > comp;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            vector<ll> dis;
            for (auto [x, y] : X)
                dis.emplace_back(count(x, y, i, j));
            sort(all(dis));
            comp.emplace_back(dis, pii(i, j));
        }
    }
    sort(all(comp));
    ll big = -1;
    for (int i = 0; i < comp.size(); i++){
        ll ans1 = 0, ans2 = 0;
        if (i > 0)
            ans1 = solve(comp[i].F, comp[i - 1].F);
        if (i + 1 < comp.size())
            ans2 = solve(comp[i].F, comp[i + 1].F);
        ans[comp[i].S.F][comp[i].S.S] = max(ans1, ans2);
        total += max(ans1, ans2);
        big = max(big, max(ans1, ans2));
    }
    cout << fixed << setprecision(5) << (double)total / (n * m) << '\n';
    cout << big << '\n';
    vector<pii> res;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (ans[i][j] == big)
                res.emplace_back(j, n + 1 - i);
    sort(all(res), [](pii a, pii b){
        if (a.S != b.S)
            return a.S < b.S;
        return a.F < b.F;
    });
    for (auto [i, j] : res)
        cout << "(" << i << "," << j << ") ";
    cout << '\n';
}