#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

int r,c;
int cc = 0;
//char G[100][100];
vector<string> G;
bool inside(int i, int j){
    return (i>=0 && i<r && j>=0 && j<c);
}
void turn(pii& dir){
    dir = make_pair(dir.s,-dir.f);
}
vector<int> simulate(int i, int j){
    vector<int> pos; 
    int seen = 0;
    int times = 1;
    int tt = 0;
    int curr = 0;
    pii dir = make_pair(-1,0);
    if(G[i][j]=='X'){
        seen++;
        pos.pb(0);
    }
    int kk = 0;
    while(seen!=cc){
        i+=dir.f; j+=dir.s;
        kk++;
        if(inside(i,j) && G[i][j]=='X'){
            pos.pb(kk);
            seen++;
        }
        curr++;
        if(curr==times){
            turn(dir);
            curr = 0; 
            tt++;
            if(tt==2){
                tt = 0; 
                times++;
            }
        }
    }
    return pos;
}
struct info{
    vi arr;
    pii pos;
    info(){}
    info(vi& a, pii start){
        arr = a; 
        pos = start;
    }
    bool operator< (const info& lhs) const { return arr < lhs.arr; } 
};
int main()
{
    //scanf("%d %d\n",&c,&r);
    cin>>c>>r;
    /*
    FOR(i,r) FOR(j,c){
        scanf("%c",&G[i][j]);
        if(G[i][j]=='X') cc++;

    }
    */
    G.resize(r);
    FOR(i,r) cin>>G[i];
    FOR(i,r) FOR(j,c) if(G[i][j]=='X') cc++;
    vector<info> A;
    FOR(i,r){
        FOR(j,c){
            //simulate until you reach all X's
            vi all = simulate(i,j);
            A.pb(info(all,make_pair(i,j)) );
        }
    }
    sort(A.begin(),A.end());
    int ans = 0;
    ll sum = 0;
    vi ans_m(sz(A),0);
    for(int i=0;i<sz(A)-1;i++){
        int l = sz(A[i].arr);
        int r = sz(A[i+1].arr);
        FOR(j,min(l,r)){
            if(A[i].arr[j]!=A[i+1].arr[j]){
                int val = min(A[i].arr[j],A[i+1].arr[j]);
                ans_m[i] = max(ans_m[i],val);
                ans_m[i+1] = max(ans_m[i+1],val);
                ans = max(ans,val);
                break;
            }
        }
    }
    FOR(i,sz(A)) sum+=ans_m[i];
    double ex = sum/(double)sz(A);
    printf("%.8lf\n%d\n",ex,ans);
    vector<pii> all;
    FOR(i,sz(A)) if(ans_m[i]==ans){
        all.pb(make_pair(A[i].pos.s+1,r-A[i].pos.f));
    }
    sort(all.begin(),all.end(),[](pii& a, pii& b){
        if(a.s==b.s) return a.f<b.f;
        return a.s<b.s;
    });
    FOR(i,sz(all)) printf("(%d,%d) ",all[i].f,all[i].s);
    printf("\n");
    //cout<<ex<<endl;
    //cout<<ans<<endl;

    return 0;
}