/*
 * author:  ADMathNoob
 * created: 08/18/24 20:52:06
 * problem: https://qoj.ac/problem/5112
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int w, h;
  cin >> w >> h;
  
  auto InRange = [&](int x, int y) {
    return 0 <= x && x < w && 0 <= y && y < h;
  };
  
  vector<vector<int>> a(w, vector<int>(h));
  for (int row = 0; row < h; row++) {
    int y = h - 1 - row;
    for (int x = 0; x < w; x++) {
      char c;
      cin >> c;
      a[x][y] = (c == 'X');
    }
  }
  vector<vector<int>> tree(1, vector<int>(2, -1));
  vector<int> sz(1, h * w);
  auto MakeNode = [&] {
    int id = tree.size();
    tree.emplace_back(2, -1);
    sz.push_back(0);
    return id;
  };
  
  int shiftX = 0, shiftY = 0;
  vector<int> dx = {0, 1, 0, -1};
  vector<int> dy = {1, 0, -1, 0};
  int dir = -1;
  int cnt = 0;
  int rem = 0;
  vector<vector<int>> alive(w, vector<int>(h, true));
  vector<vector<int>> node(w, vector<int>(h, 0));
  
  int cnt_alive = h * w;
  vector<pair<int, int>> last;
  int total_steps = 0;
  int steps = 0;
  while (true) {
    last.clear();
    for (int x = 0; x < w; x++) {
      for (int y = 0; y < h; y++) {
        if (!alive[x][y]) {
          continue;
        }
        last.emplace_back(x, y);
        int xx = x + shiftX;
        int yy = y + shiftY;
        int d = (InRange(xx, yy) ? a[xx][yy] : 0);
        if (tree[node[x][y]][d] == -1) {
          tree[node[x][y]][d] = MakeNode();
        }
        node[x][y] = tree[node[x][y]][d];
        sz[node[x][y]] += 1;
      }
    }
    for (int x = 0; x < w; x++) {
      for (int y = 0; y < h; y++) {
        if (!alive[x][y]) {
          continue;
        }
        if (sz[node[x][y]] == 1) {
          alive[x][y] = false;
          cnt_alive -= 1;
          total_steps += steps;
        }
      }
    }
    if (cnt_alive == 0) {
      break;
    }
    
    if (rem == 0) {
      cnt += 1;
      rem = (cnt + 1) / 2;
      dir = (dir + 1) % 4;
    }
    rem -= 1;
    shiftX += dx[dir];
    shiftY += dy[dir];
    steps += 1;
  }
  cout.precision(10);
  cout << fixed;
  cout << (double) total_steps / (h * w) << '\n';
  cout << steps << '\n';
  sort(last.begin(), last.end(), [&](auto p, auto q) {
    return tie(p.second, p.first) < tie(q.second, q.first);
  });
  int k = last.size();
  for (int i = 0; i < k; i++) {
    auto [x, y] = last[i];
    cout << "(" << x + 1 << "," << y + 1 << ")" << " \n"[i == k - 1];
  }
  return 0;
}