#include "bits/stdc++.h"

using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    vector<int>dirx = {-1, 0, 1, 0};
    vector<int>diry = {0, 1, 0, -1};
    int n, m;
    cin>>m>>n;
    vector<string>s(n);
    for(int i=0;i<n;i++) cin>>s[i];
    int dx = 0, dy = 0;

    vector<vector<pair<int, int>>>v;
    {
        vector<pair<int, int>>cur;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++) cur.emplace_back(i, j);
        }
        v.push_back(cur);
    }
    vector<vector<int>>ans(n, vector<int>(m, -1));
    int steps = 0, c = 0, k = 1, cnt = 0;
    while(!v.empty()){
        vector<vector<pair<int, int>>>nxt;
        for(auto& cur : v){
            vector<pair<int, int>>l, r;
            for(auto [x, y] : cur){
                int nx = x + dx;
                int ny = y + dy;
                int val = 0;
                if(0 <= nx && nx < n && 0 <= ny && ny < m && s[nx][ny] == 'X') val = 1;
                if(val) r.push_back({x, y});
                else l.push_back({x, y});
            }
            if(l.size() <= 1){
                if(!l.empty()){
                    auto [x, y] = l[0];
                    ans[x][y] = steps;
                }
            }
            else nxt.push_back(l);
            if(r.size() <= 1){
                if(!r.empty()){
                    auto [x, y] = r[0];
                    ans[x][y] = steps;
                }
            }
            else nxt.push_back(r);
        }
        swap(v, nxt);
        dx += dirx[c % 4];
        dy += diry[c % 4];
        steps++, cnt++;
        if(cnt == k) c++;
        if(cnt == k + k) c++, cnt = 0, k++;
    }
    int64_t tot = 0;
    int mx = 0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) tot += ans[i][j], mx = max(mx, ans[i][j]);
    }
    cout<<fixed<<setprecision(6);
    cout<<double(tot) / n / m<<"\n";
    cout<<mx<<"\n";
    for(int i=n-1;i>=0;i--){
        for(int j=0;j<m;j++){
            if(ans[i][j] == mx) cout<<"("<<j+1<<","<<n-i<<") ";
        }
    }
    cout<<"\n";

    return 0;
}