#include <bits/stdc++.h>
using namespace std;
struct Walk { string str; int x, y;
    int operator < (const Walk &o) const { return str < o.str; } };
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m, w; cin >> n >> m, w = max(n, m);
    vector<string> mp(m);
    for(int i = 0; i < m; ++i) cin >> mp[i];
    vector<Walk> walk(n * m);
    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};
    for(int i = 0; i < m; ++i)
        for(int j = 0; j < n; ++j) {
            const int id = i * n + j;
            int x = i, y = j, dir = 0, len = 1, nw = 0;
            walk[id].str.resize(4 * w * w);
            for(int k = 0; k < 4 * w * w; ++k) {
                walk[id].str[k] = value(x, y);
                x += dx[dir], y += dy[dir];
                if(++nw == len)
                    nw = 0, len += (dir & 1),
                    dir = (dir + 1) & 3;
            }
            walk[id].x = i, walk[id].y = j;
        }
    sort(walk.begin(), walk.end());
    vector<int> lcp(n * m);
    for(int i = 1; i < n * m; ++i)
        while(walk[i - 1].str[lcp[i]] \
            == walk[i].str[lcp[i]]) ++lcp[i];
    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("%lf\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);
}