#include <bits/stdc++.h>
using namespace std;
struct node {
  int x;
  int y;
  int k;
};
vector<node> ans;
bool in[105][105];
bool out[105][105];
int main(void) {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      char x;
      cin >> x;
      while (x != '*' && x != '.') cin >> x;
      in[i][j] = (x == '*' ? 1 : 0);
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (in[i][j] == 0) continue;
      int MMax = 0;
      while (1) {
        int k = MMax + 1;
        if ((i + k) >= n) break;
        if ((i - k) < 0) break;
        if ((j + k) >= m) break;
        if ((j - k) < 0) break;
        if (in[i + k][j] == 0) break;
        if (in[i - k][j] == 0) break;
        if (in[i][j + k] == 0) break;
        if (in[i][j - k] == 0) break;
        MMax = k;
      }
      if (MMax) {
        ans.push_back(node{i, j, MMax});
        for (int k = 0; k <= MMax; k++) {
          out[i + k][j] = 1;
          out[i - k][j] = 1;
          out[i][j + k] = 1;
          out[i][j - k] = 1;
        }
      }
    }
  }
  int ok = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (in[i][j] != out[i][j]) ok = 0;
  if (ok) {
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++)
      cout << ans[i].x + 1 << " " << ans[i].y + 1 << " " << ans[i].k << endl;
  } else {
    cout << -1 << endl;
  }
  return 0;
}
