#include<bits/stdc++.h>
using namespace std;
constexpr int M=110,mod=998244353;
constexpr int e[4][2]={{-1,0},{0,1},{1,0},{0,-1}};
vector<int>str[M*M];bool vis[M][M];char s[M];vector<pair<int,int>>ans;
int n,m,k,mx,num,res,f[M*M],g[M*M],x[M],y[M],id[M*M],calc[M*3][M*3];long long sum;
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void init(){ mx=max(n,m)+5;
	int x=mx,y=mx,d=0,cnt=0,tot=1,tmp=0;
	calc[x][y]=0;
	for (int k=1;;k++){
		x+=e[d][0];y+=e[d][1];cnt++;
		if (x<0||y<0||x>mx*2||y>mx*2) return ;calc[x][y]=k;
		if (cnt==tot) tmp++,cnt=0,d=d==3?0:d+1;
		if (tmp==2) tot++,tmp=0;
	}
}
bool cmp(int x,int y){
	for (int i=0;i<k;i++)
		if (str[x][i]<str[y][i])
			return 1;
		else if (str[x][i]>str[y][i])
			return 0;
}
int main(){
	scanf("%d%d",&m,&n);init();
	for (int i=1;i<=n;i++){
		scanf("%s",s+1);
		for (int j=1;j<=m;j++)
			if (s[j]=='X')
				x[++k]=i,y[k]=j;
	}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++){ ++num;
			for (int l=1;l<=k;l++)
				str[num].push_back(calc[x[l]-i+mx][y[l]-j+mx]);
			sort(str[num].begin(),str[num].end());
		} 
	iota(id+1,id+1+num,1);
	sort(id+1,id+1+num,cmp);
	for (int i=2;i<=num;i++)
		for (int j=0;j<k;j++)
			if (str[id[i]][j]!=str[id[i-1]][j]){
				g[i]=str[id[i-1]][j];break;
			}
	for (int i=1;i<=num;i++){
		f[i]=max(g[i+1],g[i]);
		sum+=f[i];res=max(res,f[i]);
	}
	printf("%.9lf\n%d\n",sum/(double)(n*m),res);
	for (int i=1;i<=num;i++)
		if (f[i]==res){
			const int x=(id[i]-1)/m+1,y=(id[i]-1)%m+1;
			ans.push_back({n+1-x,y});
		}
	sort(ans.begin(),ans.end());
	printf("(%d,%d)",ans[0].second,ans[0].first);
	for (int i=1;i<ans.size();i++)
		printf(" (%d,%d)",ans[i].second,ans[i].first);
	return 0;
}