#include <bits/stdc++.h>
using namespace std;
int n, m;
char a[100][100], b[100][100];
vector<pair<int, int>> vd(4);
struct node {
  pair<int, int> p;
  int sz;
};
vector<node> v;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> a[i][j], b[i][j] = a[i][j];
  vd[0].first = -1, vd[0].second = 0;
  vd[1].first = 0, vd[1].second = 1;
  vd[2].first = 1, vd[2].second = 0;
  vd[3].first = 0, vd[3].second = -1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (a[i][j] == '*') {
        int m1, m2;
        m1 = min(m - 1 - j, j);
        m2 = min(n - 1 - i, i);
        vector<pair<int, int>> p(4);
        p[0].first = i, p[0].second = j;
        p[1] = p[2] = p[3] = p[0];
        int k;
        for (k = 1; k <= min(m1, m2); k++) {
          int chk = 1;
          for (int u = 0; u < 4; u++) {
            p[u].first += vd[u].first;
            p[u].second += vd[u].second;
            int r, c;
            r = p[u].first, c = p[u].second;
            if (a[r][c] != '*') chk = 0;
          }
          if (!chk) break;
          for (int u = 0; u < 4; u++) {
            int r, c;
            r = p[u].first, c = p[u].second;
            b[r][c] = '.';
          }
        }
        k -= 1;
        if (k > 0) {
          node tmp;
          tmp.p.first = i, tmp.p.second = j;
          b[i][j] = '.';
          tmp.sz = k;
          v.push_back(tmp);
        }
      }
  int chk = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (b[i][j] == '*') chk = 0;
  if (chk) {
    cout << v.size() << "\n";
    for (int i = 0; i < v.size(); i++)
      cout << v[i].p.first + 1 << " " << v[i].p.second + 1 << " " << v[i].sz
           << "\n";
  } else
    cout << -1;
  return 0;
}
