//
// Stvoreno ENERGom o 11.04.24. 13:34:12
//

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define F first
#define fir first
#define S second
#define sec second
#define mp make_pair
#define MP make_pair
#define pb push_back
#define PB push_back

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

#ifdef Energy
#define DEBUG for (int _____DEBUG=1;_____DEBUG;_____DEBUG=0)

template<class ...Ts>
auto &PRNT(Ts ...ts) { return ((cerr << ts << " "), ...); }

#define LOG(...) PRNT(#__VA_ARGS__" ::",__VA_ARGS__)<<endl
#else
#define DEBUG while (0)
#define LOG(...)
#endif

const int max_n = 111, inf = 1000111222;
const int max_x = 40001112;

int n, m, ans[max_n][max_n];
int a[max_n][max_n];
int nxt[max_x], cnt[max_x];
string s[max_n];
vector<pair<int, int>> deltas;

void calc_deltas() {
    deltas.push_back({0, 0});
    for (int len = 1; deltas.size() < 474747; ++len) {
        for (int i = 0; i < len; ++i) {
            deltas.push_back(deltas.back());
            --deltas.back().first;
        }
        for (int i = 0; i < len; ++i) {
            deltas.push_back(deltas.back());
            ++deltas.back().second;
        }
        ++len;
        for (int i = 0; i < len; ++i) {
            deltas.push_back(deltas.back());
            ++deltas.back().first;
        }
        for (int i = 0; i < len; ++i) {
            deltas.push_back(deltas.back());
            --deltas.back().second;
        }
    }
    if (0) {
        for (int i = 0; i < 25; ++i) {
            LOG(deltas[i].first, deltas[i].second);
        }
    };
}

bool is_in(int x, int y) {
    return 0 <= x && 0 <= y && x < n && y < m;
}

pair<int, int> find_val(int val) {
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (a[i][j] == val) {
                return {i, j};
            }
        }
    }
    exit(47);
}

int main() {
//    freopen("input_l.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    calc_deltas();
    cin >> m >> n;
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }
    int unknown = 0;
    vector<pair<int, int>> v;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            a[i][j] = s[i][j] == 'X';
            ++cnt[a[i][j]];
            if (a[i][j]) {
                v.push_back({i, j});
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            ans[i][j] = -1;
            if (cnt[a[i][j]] == 1) {
                ans[i][j] = 0;
            }
            unknown += ans[i][j] == -1;
        }
    }
    int first = 2;
    vector<array<int, 4>> diffs;
    for (int it = 1; unknown && it < deltas.size(); ++it) {
        const auto [dx, dy] = deltas[it];
        diffs.clear();
        for (auto [sx, sy] : v) {
            int x = sx - dx, y = sy - dy;
            if (is_in(x, y) && ans[x][y] == -1) {
                if (nxt[a[x][y]] == 0) {
                    nxt[a[x][y]] = first;
                    ++first;
                }
                --cnt[a[x][y]];
                diffs.push_back({x, y, a[x][y], nxt[a[x][y]]});
                a[x][y] = nxt[a[x][y]];
                ++cnt[a[x][y]];
            }
        }
        for (auto [x, y, old_val, new_val] : diffs) {
            nxt[old_val] = 0;
            if (cnt[new_val] == 1) {
                ans[x][y] = it;
                --unknown;
            }
            if (cnt[old_val] == 1) {
                cnt[old_val] = 0;
                auto [X, Y] = find_val(old_val);
                ans[X][Y] = it;
                --unknown;
            }
        }
    }
    LOG(unknown);
    int mx = -1;
    vector<pair<int, int>> best;
    ld avg = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
//            cout << ans[i][j] << " ";
            avg += ans[i][j];
            if (mx < ans[i][j]) {
                mx = ans[i][j];
                best.clear();
            }
            if (mx == ans[i][j]) {
                best.push_back({n - 1 - i, j});
            }
        }
//        cout << "\n";
    }
    avg /= n * m;
    cout << fixed << setprecision(10) << avg << "\n";
    cout << mx << "\n";
    sort(best.begin(), best.end());
    for (auto [y, x] : best) {
        cout << "(" << x + 1 << "," << y + 1 << ") ";
    }
    exit(0);
}