#include <bits/stdc++.h>
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#define pb push_back
#define ALL(s) s.begin(),s.end()
#define FIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define SZ(s) int(s.size())
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;

int get(int x, int y){
	int df=max(abs(x),abs(y));
	if(!df) return 1;
	
	int ans=(2*df-1)*(2*df-1);
	
	if(y==df && x!=-df) return ans+df+x;
	
	ans+=2*df;
	if(x==df && y!=df) return ans+df-y;
	
	ans+=2*df;
	if(y==-df && x!=df) return ans+df-x;
	
	ans+=2*df;
	if(x==-df && y!=-df) return ans+df+y;

	assert(0);
}

vector<int> get(vector<ii> &v, int x, int y){
	vector<int> wh;
	fore(i,0,SZ(v)) wh.pb(get(v[i].snd-y, x-v[i].fst));
	sort(ALL(wh));
	for(int i=SZ(wh)-1;i>=1;i--) wh[i]-=wh[i-1];
	return wh;
}

const int MAXN=1e6+10;
map<int,int> t[MAXN];
int idd=1,am[MAXN];

void add(vector<int> &v){
	int now=0;
	for(auto x:v){
		if(!t[now].count(x)) t[now][x]=idd++;
		now=t[now][x];
		am[now]++;
	}
}

int get(vector<int> &v){
	int now=0,sz=0;
	for(auto x:v){
		int to=t[now][x];
		if(am[to]==1){
			//con uno mas grande
			int ans=sz+x;
			
			auto it=t[now].lower_bound(x);
			if(it!=t[now].begin() && next(it)==t[now].end()) ans=sz+(--it)->fst;
			
			return ans;
		}
		now=to;
		sz+=x;
	}
	
	assert(0);
}

int main(){FIN;
	int n,m; cin>>m>>n;
	vector<ii> v;
	fore(i,0,n){
		string s; cin>>s;
		fore(j,0,m) if(s[j]=='X') v.pb({i,j});
	}
	
	vector<int> val;
	fore(i,0,n) fore(j,0,m){
		auto now=get(v,i,j);
		add(now);
	}
	
	ll res=0;
	int mx=0;
	vector<ii> ans;
	fore(i,0,n) fore(j,0,m){
		auto now=get(v,i,j);
		int val=get(now)-1;
		if(val>mx) mx=val, ans={{j,n-i-1}};
		else if(val==mx) ans.pb({j,n-i-1});
		res+=val;
	}
	
	for(auto &x:ans) swap(x.fst,x.snd);
	sort(ALL(ans));
	for(auto &x:ans) swap(x.fst,x.snd);
	
	cout<<fixed<<setprecision(10)<<1.*res/(n*m)<<"\n";
	cout<<mx<<"\n";
	for(auto x:ans)cout<<"("<<x.fst+1<<","<<x.snd+1<<") ";cout<<"\n";
}